./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R --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 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- 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-38b53e6 [2022-11-25 15:44:39,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:44:39,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:44:39,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:44:39,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:44:39,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:44:39,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:44:39,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:44:39,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:44:39,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:44:39,471 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:44:39,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:44:39,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:44:39,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:44:39,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:44:39,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:44:39,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:44:39,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:44:39,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:44:39,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:44:39,494 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:44:39,495 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:44:39,496 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:44:39,497 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:44:39,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:44:39,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:44:39,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:44:39,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:44:39,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:44:39,503 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:44:39,503 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:44:39,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:44:39,505 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:44:39,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:44:39,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:44:39,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:44:39,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:44:39,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:44:39,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:44:39,512 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:44:39,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:44:39,516 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 15:44:39,555 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:44:39,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:44:39,556 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:44:39,556 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:44:39,557 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:44:39,557 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:44:39,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:44:39,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:44:39,558 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:44:39,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:44:39,559 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:44:39,559 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:44:39,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:44:39,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:44:39,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:44:39,560 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 15:44:39,560 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 15:44:39,561 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 15:44:39,561 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:44:39,561 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 15:44:39,561 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:44:39,561 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:44:39,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:44:39,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:44:39,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:44:39,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:44:39,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:44:39,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:44:39,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:44:39,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:44:39,563 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:44:39,563 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:44:39,564 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:44:39,564 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/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_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R 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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2022-11-25 15:44:39,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:44:39,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:44:39,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:44:39,893 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:44:39,893 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:44:39,895 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-25 15:44:43,026 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:44:43,315 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:44:43,315 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-25 15:44:43,341 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/data/5144db5e1/a00402edf4764177941fd475c4146656/FLAGa2efdcdf8 [2022-11-25 15:44:43,357 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/data/5144db5e1/a00402edf4764177941fd475c4146656 [2022-11-25 15:44:43,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:44:43,366 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:44:43,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:44:43,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:44:43,372 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:44:43,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:44:43" (1/1) ... [2022-11-25 15:44:43,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56fe5864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:43, skipping insertion in model container [2022-11-25 15:44:43,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:44:43" (1/1) ... [2022-11-25 15:44:43,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:44:43,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:44:43,779 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-25 15:44:43,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:44:43,793 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:44:43,832 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-25 15:44:43,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:44:43,860 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:44:43,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:43 WrapperNode [2022-11-25 15:44:43,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:44:43,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:44:43,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:44:43,862 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:44:43,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:43" (1/1) ... [2022-11-25 15:44:43,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:43" (1/1) ... [2022-11-25 15:44:43,904 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2022-11-25 15:44:43,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:44:43,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:44:43,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:44:43,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:44:43,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:43" (1/1) ... [2022-11-25 15:44:43,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:43" (1/1) ... [2022-11-25 15:44:43,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:43" (1/1) ... [2022-11-25 15:44:43,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:43" (1/1) ... [2022-11-25 15:44:43,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:43" (1/1) ... [2022-11-25 15:44:43,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:43" (1/1) ... [2022-11-25 15:44:43,933 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:43" (1/1) ... [2022-11-25 15:44:43,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:43" (1/1) ... [2022-11-25 15:44:43,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:44:43,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:44:43,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:44:43,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:44:43,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:43" (1/1) ... [2022-11-25 15:44:43,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:44:43,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:44:43,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:44:43,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:44:44,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 15:44:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:44:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 15:44:44,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:44:44,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 15:44:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 15:44:44,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:44:44,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:44:44,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:44:44,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:44:44,143 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:44:44,146 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:44:44,519 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:44:44,526 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:44:44,526 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-25 15:44:44,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:44:44 BoogieIcfgContainer [2022-11-25 15:44:44,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:44:44,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:44:44,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:44:44,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:44:44,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:44:43" (1/3) ... [2022-11-25 15:44:44,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605898cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:44:44, skipping insertion in model container [2022-11-25 15:44:44,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:43" (2/3) ... [2022-11-25 15:44:44,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605898cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:44:44, skipping insertion in model container [2022-11-25 15:44:44,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:44:44" (3/3) ... [2022-11-25 15:44:44,537 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2022-11-25 15:44:44,566 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:44:44,566 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-11-25 15:44:44,633 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:44:44,642 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=PETRI_NET, 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;@69f07d46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:44:44,643 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-25 15:44:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:44,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 15:44:44,654 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:44,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 15:44:44,656 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:44:44,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:44,665 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2022-11-25 15:44:44,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:44,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100768185] [2022-11-25 15:44:44,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:44,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:44,993 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-25 15:44:44,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:44,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100768185] [2022-11-25 15:44:44,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100768185] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:44,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:44:44,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:44:44,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686141442] [2022-11-25 15:44:44,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:45,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:44:45,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:45,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:44:45,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:44:45,063 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:45,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:45,228 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-11-25 15:44:45,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:44:45,231 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 15:44:45,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:45,254 INFO L225 Difference]: With dead ends: 109 [2022-11-25 15:44:45,255 INFO L226 Difference]: Without dead ends: 104 [2022-11-25 15:44:45,257 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-25 15:44:45,262 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 63 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:45,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 133 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:44:45,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-25 15:44:45,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2022-11-25 15:44:45,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.6) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-11-25 15:44:45,310 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 5 [2022-11-25 15:44:45,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:45,311 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-11-25 15:44:45,311 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:45,312 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-11-25 15:44:45,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 15:44:45,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:45,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 15:44:45,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:44:45,313 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:44:45,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:45,314 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2022-11-25 15:44:45,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:45,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961382542] [2022-11-25 15:44:45,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:45,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:45,445 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-25 15:44:45,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:45,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961382542] [2022-11-25 15:44:45,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961382542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:45,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:44:45,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:44:45,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347569221] [2022-11-25 15:44:45,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:45,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:44:45,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:45,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:44:45,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:44:45,450 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:45,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:45,508 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-11-25 15:44:45,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:44:45,509 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 15:44:45,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:45,510 INFO L225 Difference]: With dead ends: 102 [2022-11-25 15:44:45,510 INFO L226 Difference]: Without dead ends: 102 [2022-11-25 15:44:45,511 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-25 15:44:45,512 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 58 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:45,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:44:45,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-25 15:44:45,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 57. [2022-11-25 15:44:45,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.55) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:45,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-11-25 15:44:45,520 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 5 [2022-11-25 15:44:45,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:45,520 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-11-25 15:44:45,521 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:45,521 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-11-25 15:44:45,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 15:44:45,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:45,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:44:45,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:44:45,522 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:44:45,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:45,523 INFO L85 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2022-11-25 15:44:45,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:45,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012985885] [2022-11-25 15:44:45,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:45,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:45,603 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-25 15:44:45,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:45,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012985885] [2022-11-25 15:44:45,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012985885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:45,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:44:45,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:44:45,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392278373] [2022-11-25 15:44:45,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:45,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:44:45,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:45,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:44:45,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:44:45,606 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:45,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:45,619 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-11-25 15:44:45,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:44:45,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 15:44:45,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:45,621 INFO L225 Difference]: With dead ends: 68 [2022-11-25 15:44:45,621 INFO L226 Difference]: Without dead ends: 68 [2022-11-25 15:44:45,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:44:45,623 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:45,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:44:45,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-25 15:44:45,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2022-11-25 15:44:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-11-25 15:44:45,630 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 8 [2022-11-25 15:44:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:45,631 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-11-25 15:44:45,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-11-25 15:44:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 15:44:45,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:45,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:44:45,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:44:45,633 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:44:45,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:45,633 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2022-11-25 15:44:45,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:45,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810400028] [2022-11-25 15:44:45,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:45,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:45,753 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-25 15:44:45,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:45,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810400028] [2022-11-25 15:44:45,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810400028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:45,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:44:45,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:44:45,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531966068] [2022-11-25 15:44:45,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:45,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:44:45,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:45,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:44:45,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:44:45,757 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:45,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:45,876 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-11-25 15:44:45,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:44:45,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 15:44:45,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:45,878 INFO L225 Difference]: With dead ends: 76 [2022-11-25 15:44:45,878 INFO L226 Difference]: Without dead ends: 76 [2022-11-25 15:44:45,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:44:45,880 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 164 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:45,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 67 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:44:45,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-25 15:44:45,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2022-11-25 15:44:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-11-25 15:44:45,888 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 9 [2022-11-25 15:44:45,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:45,888 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-11-25 15:44:45,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:45,889 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-11-25 15:44:45,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 15:44:45,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:45,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:44:45,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:44:45,890 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:44:45,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:45,891 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2022-11-25 15:44:45,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:45,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862578455] [2022-11-25 15:44:45,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:45,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,130 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-25 15:44:46,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:46,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862578455] [2022-11-25 15:44:46,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862578455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:46,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:44:46,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:44:46,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177172230] [2022-11-25 15:44:46,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:46,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:44:46,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:46,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:44:46,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:44:46,134 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:46,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:46,251 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-11-25 15:44:46,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:44:46,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 15:44:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:46,256 INFO L225 Difference]: With dead ends: 61 [2022-11-25 15:44:46,256 INFO L226 Difference]: Without dead ends: 61 [2022-11-25 15:44:46,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:44:46,264 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 163 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:46,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 45 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:44:46,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-25 15:44:46,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2022-11-25 15:44:46,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:46,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-11-25 15:44:46,279 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2022-11-25 15:44:46,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:46,279 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-11-25 15:44:46,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:46,281 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-11-25 15:44:46,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 15:44:46,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:46,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:44:46,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:44:46,287 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:44:46,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:46,287 INFO L85 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2022-11-25 15:44:46,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:46,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187706088] [2022-11-25 15:44:46,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:46,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:44:46,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:46,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187706088] [2022-11-25 15:44:46,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187706088] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:44:46,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341980827] [2022-11-25 15:44:46,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:46,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:44:46,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:44:46,451 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:44:46,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 15:44:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:46,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:44:46,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:44:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:44:46,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:44:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:44:46,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341980827] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:44:46,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:44:46,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-25 15:44:46,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282925415] [2022-11-25 15:44:46,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:44:46,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:44:46,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:46,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:44:46,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:44:46,728 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:46,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:46,742 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-11-25 15:44:46,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:44:46,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 15:44:46,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:46,743 INFO L225 Difference]: With dead ends: 65 [2022-11-25 15:44:46,743 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 15:44:46,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:44:46,745 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:46,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 163 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:44:46,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 15:44:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-25 15:44:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.4) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-11-25 15:44:46,750 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 17 [2022-11-25 15:44:46,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:46,751 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-11-25 15:44:46,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:46,751 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-11-25 15:44:46,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 15:44:46,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:46,752 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:44:46,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 15:44:46,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 15:44:46,959 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:44:46,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:46,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 2 times [2022-11-25 15:44:46,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:46,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901814296] [2022-11-25 15:44:46,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:46,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:47,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 15:44:47,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:47,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901814296] [2022-11-25 15:44:47,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901814296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:47,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:44:47,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 15:44:47,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440570673] [2022-11-25 15:44:47,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:47,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:44:47,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:47,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:44:47,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:44:47,234 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:47,530 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-11-25 15:44:47,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:44:47,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 15:44:47,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:47,531 INFO L225 Difference]: With dead ends: 116 [2022-11-25 15:44:47,531 INFO L226 Difference]: Without dead ends: 116 [2022-11-25 15:44:47,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:44:47,532 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 380 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:47,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 141 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 15:44:47,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-25 15:44:47,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 68. [2022-11-25 15:44:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-11-25 15:44:47,537 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 26 [2022-11-25 15:44:47,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:47,538 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-11-25 15:44:47,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:47,538 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-11-25 15:44:47,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 15:44:47,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:47,539 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:44:47,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:44:47,539 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:44:47,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:47,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913171, now seen corresponding path program 1 times [2022-11-25 15:44:47,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:47,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568615395] [2022-11-25 15:44:47,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:47,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 15:44:47,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:47,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568615395] [2022-11-25 15:44:47,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568615395] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:44:47,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762763079] [2022-11-25 15:44:47,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:47,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:44:47,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:44:47,766 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:44:47,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 15:44:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:47,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:44:47,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:44:47,952 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 15:44:47,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:44:47,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762763079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:47,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 15:44:47,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-11-25 15:44:47,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315638588] [2022-11-25 15:44:47,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:47,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:44:47,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:47,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:44:47,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:44:47,958 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:48,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:48,017 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2022-11-25 15:44:48,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:44:48,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 15:44:48,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:48,018 INFO L225 Difference]: With dead ends: 96 [2022-11-25 15:44:48,018 INFO L226 Difference]: Without dead ends: 96 [2022-11-25 15:44:48,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:44:48,023 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 110 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:48,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 151 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:44:48,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-25 15:44:48,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2022-11-25 15:44:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 70 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2022-11-25 15:44:48,038 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 26 [2022-11-25 15:44:48,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:48,038 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2022-11-25 15:44:48,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:48,039 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-11-25 15:44:48,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 15:44:48,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:48,039 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:44:48,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 15:44:48,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:44:48,246 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:44:48,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:48,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913226, now seen corresponding path program 1 times [2022-11-25 15:44:48,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:48,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147402739] [2022-11-25 15:44:48,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:48,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:48,629 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 15:44:48,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:48,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147402739] [2022-11-25 15:44:48,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147402739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:48,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:44:48,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 15:44:48,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868974662] [2022-11-25 15:44:48,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:48,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:44:48,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:48,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:44:48,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:44:48,631 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:48,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:48,949 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2022-11-25 15:44:48,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:44:48,949 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 15:44:48,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:48,950 INFO L225 Difference]: With dead ends: 107 [2022-11-25 15:44:48,950 INFO L226 Difference]: Without dead ends: 107 [2022-11-25 15:44:48,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:44:48,951 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 366 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:48,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 106 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:44:48,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-25 15:44:48,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 71. [2022-11-25 15:44:48,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.375) internal successors, (77), 70 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:48,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2022-11-25 15:44:48,955 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 26 [2022-11-25 15:44:48,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:48,955 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2022-11-25 15:44:48,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:48,957 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2022-11-25 15:44:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 15:44:48,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:48,957 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:44:48,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:44:48,958 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:44:48,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:48,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2022-11-25 15:44:48,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:48,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233751191] [2022-11-25 15:44:48,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:48,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:44:49,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:49,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233751191] [2022-11-25 15:44:49,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233751191] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:44:49,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018121604] [2022-11-25 15:44:49,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:49,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:44:49,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:44:49,759 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:44:49,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 15:44:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:49,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-25 15:44:49,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:44:49,935 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-25 15:44:49,994 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 15:44:49,995 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-25 15:44:50,114 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-25 15:44:50,321 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 21 treesize of output 9 [2022-11-25 15:44:50,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:44:50,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:44:50,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:44:50,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018121604] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:44:50,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:44:50,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-11-25 15:44:50,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603905149] [2022-11-25 15:44:50,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:44:50,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-25 15:44:50,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:50,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-25 15:44:50,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2022-11-25 15:44:50,728 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 33 states, 32 states have (on average 1.9375) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:52,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:52,147 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2022-11-25 15:44:52,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 15:44:52,148 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.9375) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-25 15:44:52,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:52,150 INFO L225 Difference]: With dead ends: 105 [2022-11-25 15:44:52,150 INFO L226 Difference]: Without dead ends: 105 [2022-11-25 15:44:52,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=538, Invalid=1814, Unknown=0, NotChecked=0, Total=2352 [2022-11-25 15:44:52,151 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 814 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:52,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 491 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 15:44:52,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-25 15:44:52,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2022-11-25 15:44:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:52,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2022-11-25 15:44:52,165 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 29 [2022-11-25 15:44:52,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:52,165 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2022-11-25 15:44:52,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.9375) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:52,165 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2022-11-25 15:44:52,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 15:44:52,166 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:52,166 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:44:52,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 15:44:52,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 15:44:52,367 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:44:52,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:52,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687585, now seen corresponding path program 1 times [2022-11-25 15:44:52,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:52,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502626538] [2022-11-25 15:44:52,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:52,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:44:53,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:53,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502626538] [2022-11-25 15:44:53,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502626538] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:44:53,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544334381] [2022-11-25 15:44:53,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:53,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:44:53,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:44:53,237 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:44:53,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 15:44:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:53,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-25 15:44:53,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:44:53,380 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-25 15:44:53,616 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 15:44:53,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 15:44:53,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:44:53,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 15:44:53,793 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-25 15:44:54,093 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 39 treesize of output 21 [2022-11-25 15:44:54,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-11-25 15:44:54,192 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:44:54,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:44:55,284 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-25 15:44:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:44:55,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544334381] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:44:55,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:44:55,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 43 [2022-11-25 15:44:55,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946950965] [2022-11-25 15:44:55,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:44:55,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-25 15:44:55,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:55,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-25 15:44:55,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1772, Unknown=0, NotChecked=0, Total=1892 [2022-11-25 15:44:55,392 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:00,472 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2022-11-25 15:45:00,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 15:45:00,473 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-25 15:45:00,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:00,474 INFO L225 Difference]: With dead ends: 213 [2022-11-25 15:45:00,474 INFO L226 Difference]: Without dead ends: 213 [2022-11-25 15:45:00,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=818, Invalid=3738, Unknown=0, NotChecked=0, Total=4556 [2022-11-25 15:45:00,477 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2924 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2924 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:00,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2924 Valid, 904 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 15:45:00,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-25 15:45:00,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 84. [2022-11-25 15:45:00,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.391304347826087) internal successors, (96), 83 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2022-11-25 15:45:00,492 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 29 [2022-11-25 15:45:00,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:00,492 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2022-11-25 15:45:00,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:00,493 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2022-11-25 15:45:00,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 15:45:00,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:00,499 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:00,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-25 15:45:00,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:45:00,700 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:45:00,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:00,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1082686446, now seen corresponding path program 2 times [2022-11-25 15:45:00,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:00,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231467155] [2022-11-25 15:45:00,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:00,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:00,840 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 15:45:00,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:00,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231467155] [2022-11-25 15:45:00,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231467155] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:45:00,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224476396] [2022-11-25 15:45:00,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:45:00,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:45:00,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:45:00,842 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:45:00,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 15:45:00,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:45:00,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:45:00,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:45:00,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:01,023 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 15:45:01,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:45:01,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224476396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:01,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 15:45:01,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2022-11-25 15:45:01,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066737547] [2022-11-25 15:45:01,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:01,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:45:01,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:01,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:45:01,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:45:01,026 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:01,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:01,069 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-11-25 15:45:01,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:45:01,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-25 15:45:01,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:01,070 INFO L225 Difference]: With dead ends: 70 [2022-11-25 15:45:01,070 INFO L226 Difference]: Without dead ends: 70 [2022-11-25 15:45:01,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:45:01,071 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 165 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:01,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 73 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:45:01,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-25 15:45:01,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-25 15:45:01,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.293103448275862) internal successors, (75), 69 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-11-25 15:45:01,085 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 32 [2022-11-25 15:45:01,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:01,086 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-11-25 15:45:01,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-11-25 15:45:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 15:45:01,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:01,090 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:01,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:01,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 15:45:01,297 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:45:01,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:01,299 INFO L85 PathProgramCache]: Analyzing trace with hash -516260032, now seen corresponding path program 1 times [2022-11-25 15:45:01,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:01,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135614446] [2022-11-25 15:45:01,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:01,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:01,433 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 15:45:01,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:01,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135614446] [2022-11-25 15:45:01,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135614446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:01,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:01,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 15:45:01,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894342139] [2022-11-25 15:45:01,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:01,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:45:01,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:01,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:45:01,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:45:01,437 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:01,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:01,649 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2022-11-25 15:45:01,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:45:01,649 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-25 15:45:01,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:01,650 INFO L225 Difference]: With dead ends: 89 [2022-11-25 15:45:01,650 INFO L226 Difference]: Without dead ends: 89 [2022-11-25 15:45:01,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:45:01,651 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 338 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:01,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 109 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:45:01,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-25 15:45:01,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2022-11-25 15:45:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 72 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:01,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2022-11-25 15:45:01,654 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 36 [2022-11-25 15:45:01,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:01,654 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2022-11-25 15:45:01,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:01,654 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2022-11-25 15:45:01,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 15:45:01,655 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:01,655 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:01,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 15:45:01,655 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:45:01,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:01,656 INFO L85 PathProgramCache]: Analyzing trace with hash -516260031, now seen corresponding path program 1 times [2022-11-25 15:45:01,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:01,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953294491] [2022-11-25 15:45:01,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:01,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:01,765 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 15:45:01,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:01,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953294491] [2022-11-25 15:45:01,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953294491] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:45:01,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145460347] [2022-11-25 15:45:01,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:01,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:45:01,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:45:01,768 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:45:01,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 15:45:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:01,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 15:45:01,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 15:45:01,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:45:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 15:45:02,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145460347] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:45:02,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:45:02,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-11-25 15:45:02,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282050385] [2022-11-25 15:45:02,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:45:02,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:45:02,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:02,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:45:02,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:45:02,013 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:02,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:02,060 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2022-11-25 15:45:02,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:45:02,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-25 15:45:02,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:02,062 INFO L225 Difference]: With dead ends: 95 [2022-11-25 15:45:02,063 INFO L226 Difference]: Without dead ends: 95 [2022-11-25 15:45:02,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:45:02,063 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 123 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:02,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 143 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:45:02,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-25 15:45:02,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2022-11-25 15:45:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 88 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2022-11-25 15:45:02,067 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 36 [2022-11-25 15:45:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:02,067 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2022-11-25 15:45:02,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2022-11-25 15:45:02,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 15:45:02,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:02,068 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:02,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:02,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 15:45:02,274 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:45:02,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:02,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1215669110, now seen corresponding path program 1 times [2022-11-25 15:45:02,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:02,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796495091] [2022-11-25 15:45:02,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:02,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:02,451 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 15:45:02,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:02,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796495091] [2022-11-25 15:45:02,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796495091] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:45:02,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706446478] [2022-11-25 15:45:02,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:02,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:45:02,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:45:02,456 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:45:02,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 15:45:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:02,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:45:02,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 15:45:02,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:45:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 15:45:02,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706446478] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:45:02,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:45:02,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-25 15:45:02,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766267126] [2022-11-25 15:45:02,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:45:02,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:45:02,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:02,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:45:02,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:45:02,726 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:02,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:02,783 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2022-11-25 15:45:02,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:45:02,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-25 15:45:02,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:02,784 INFO L225 Difference]: With dead ends: 90 [2022-11-25 15:45:02,784 INFO L226 Difference]: Without dead ends: 90 [2022-11-25 15:45:02,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:45:02,785 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 148 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:02,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 165 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:45:02,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-25 15:45:02,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2022-11-25 15:45:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.36986301369863) internal successors, (100), 83 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2022-11-25 15:45:02,788 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 37 [2022-11-25 15:45:02,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:02,789 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2022-11-25 15:45:02,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:02,789 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2022-11-25 15:45:02,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 15:45:02,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:02,790 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:02,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:02,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 15:45:02,996 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:45:02,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:02,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522149, now seen corresponding path program 2 times [2022-11-25 15:45:02,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:02,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211861836] [2022-11-25 15:45:02,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:02,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 15:45:03,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:03,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211861836] [2022-11-25 15:45:03,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211861836] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:45:03,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861990185] [2022-11-25 15:45:03,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:45:03,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:45:03,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:45:03,140 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:45:03,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 15:45:03,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 15:45:03,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:45:03,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:45:03,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-25 15:45:03,323 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:45:03,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861990185] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:03,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 15:45:03,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-11-25 15:45:03,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529548839] [2022-11-25 15:45:03,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:03,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:45:03,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:03,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:45:03,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:45:03,325 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:03,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:03,370 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-11-25 15:45:03,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:45:03,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-25 15:45:03,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:03,371 INFO L225 Difference]: With dead ends: 89 [2022-11-25 15:45:03,372 INFO L226 Difference]: Without dead ends: 89 [2022-11-25 15:45:03,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:45:03,372 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 80 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:03,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 136 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:45:03,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-25 15:45:03,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2022-11-25 15:45:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 82 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2022-11-25 15:45:03,376 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 41 [2022-11-25 15:45:03,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:03,376 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2022-11-25 15:45:03,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:03,376 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-11-25 15:45:03,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 15:45:03,377 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:03,377 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:03,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:03,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 15:45:03,583 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:45:03,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:03,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522204, now seen corresponding path program 1 times [2022-11-25 15:45:03,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:03,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712158840] [2022-11-25 15:45:03,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:03,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:03,888 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 15:45:03,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:03,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712158840] [2022-11-25 15:45:03,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712158840] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:03,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:03,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 15:45:03,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289083015] [2022-11-25 15:45:03,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:03,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:45:03,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:03,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:45:03,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:45:03,891 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:04,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:04,146 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-11-25 15:45:04,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:45:04,147 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-25 15:45:04,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:04,147 INFO L225 Difference]: With dead ends: 107 [2022-11-25 15:45:04,148 INFO L226 Difference]: Without dead ends: 107 [2022-11-25 15:45:04,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:45:04,148 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 414 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:04,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 80 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:45:04,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-25 15:45:04,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2022-11-25 15:45:04,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 82 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2022-11-25 15:45:04,151 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 41 [2022-11-25 15:45:04,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:04,151 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2022-11-25 15:45:04,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:04,151 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2022-11-25 15:45:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-25 15:45:04,152 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:04,152 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:04,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 15:45:04,152 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:45:04,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:04,152 INFO L85 PathProgramCache]: Analyzing trace with hash -333530929, now seen corresponding path program 1 times [2022-11-25 15:45:04,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:04,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299176322] [2022-11-25 15:45:04,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:04,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:05,392 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 15:45:05,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:05,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299176322] [2022-11-25 15:45:05,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299176322] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:45:05,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634779197] [2022-11-25 15:45:05,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:05,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:45:05,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:45:05,394 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:45:05,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 15:45:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:05,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-25 15:45:05,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:05,591 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-25 15:45:05,637 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 15:45:05,637 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-25 15:45:05,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 15:45:05,784 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:45:05,785 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-25 15:45:05,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:45:05,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-11-25 15:45:05,992 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-25 15:45:05,999 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 15:45:05,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:45:06,238 INFO L321 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-11-25 15:45:06,238 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 21 treesize of output 20 [2022-11-25 15:45:06,336 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_976) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2022-11-25 15:45:06,343 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2022-11-25 15:45:06,420 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) .cse0)))) is different from false [2022-11-25 15:45:06,426 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))))) is different from false [2022-11-25 15:45:06,528 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:45:06,529 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 22 treesize of output 23 [2022-11-25 15:45:06,532 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 36 treesize of output 24 [2022-11-25 15:45:06,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 15:45:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2022-11-25 15:45:06,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634779197] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:45:06,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:45:06,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 42 [2022-11-25 15:45:06,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418625960] [2022-11-25 15:45:06,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:45:06,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-25 15:45:06,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:06,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-25 15:45:06,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1349, Unknown=26, NotChecked=308, Total=1806 [2022-11-25 15:45:06,829 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 43 states, 42 states have (on average 2.261904761904762) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:08,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:08,834 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2022-11-25 15:45:08,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 15:45:08,835 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.261904761904762) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-25 15:45:08,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:08,835 INFO L225 Difference]: With dead ends: 136 [2022-11-25 15:45:08,835 INFO L226 Difference]: Without dead ends: 136 [2022-11-25 15:45:08,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=668, Invalid=3354, Unknown=26, NotChecked=508, Total=4556 [2022-11-25 15:45:08,838 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 1045 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 363 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:08,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 643 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 841 Invalid, 0 Unknown, 363 Unchecked, 0.6s Time] [2022-11-25 15:45:08,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-25 15:45:08,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2022-11-25 15:45:08,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.35) internal successors, (108), 90 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:08,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2022-11-25 15:45:08,840 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 44 [2022-11-25 15:45:08,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:08,841 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2022-11-25 15:45:08,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.261904761904762) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:08,841 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2022-11-25 15:45:08,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-25 15:45:08,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:08,841 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:08,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:09,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 15:45:09,042 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:45:09,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:09,042 INFO L85 PathProgramCache]: Analyzing trace with hash -333530928, now seen corresponding path program 1 times [2022-11-25 15:45:09,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:09,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272253719] [2022-11-25 15:45:09,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:09,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:10,470 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 15:45:10,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:10,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272253719] [2022-11-25 15:45:10,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272253719] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:45:10,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576244272] [2022-11-25 15:45:10,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:10,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:45:10,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:45:10,476 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:45:10,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 15:45:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:10,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-25 15:45:10,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:10,661 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-25 15:45:10,829 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 15:45:10,829 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-25 15:45:10,958 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-25 15:45:10,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 15:45:11,356 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:45:11,357 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 54 treesize of output 53 [2022-11-25 15:45:11,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2022-11-25 15:45:11,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:45:11,541 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 40 treesize of output 33 [2022-11-25 15:45:11,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:45:11,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2022-11-25 15:45:11,670 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 39 treesize of output 21 [2022-11-25 15:45:11,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-11-25 15:45:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 15:45:11,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:45:12,299 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:45:12,299 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 47 treesize of output 51 [2022-11-25 15:45:12,335 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1088 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 1))) (forall ((v_ArrVal_1089 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2022-11-25 15:45:12,363 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (+ |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset| 1))) (forall ((v_ArrVal_1088 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_1089 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2022-11-25 15:45:12,384 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1088 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2) 1))) (forall ((v_ArrVal_1089 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2022-11-25 15:45:12,408 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1089 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) .cse0)) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_1088 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2022-11-25 15:45:12,423 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (and (forall ((v_ArrVal_1089 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1089) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) .cse0)) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) 1))) (forall ((v_ArrVal_1088 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1)))))) is different from false [2022-11-25 15:45:12,916 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2022-11-25 15:45:12,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576244272] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:45:12,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:45:12,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 52 [2022-11-25 15:45:12,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29725775] [2022-11-25 15:45:12,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:45:12,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-25 15:45:12,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:12,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-25 15:45:12,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2112, Unknown=5, NotChecked=480, Total=2756 [2022-11-25 15:45:12,920 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 53 states, 52 states have (on average 2.1153846153846154) internal successors, (110), 53 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:17,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:17,223 INFO L93 Difference]: Finished difference Result 191 states and 207 transitions. [2022-11-25 15:45:17,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-25 15:45:17,223 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.1153846153846154) internal successors, (110), 53 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-25 15:45:17,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:17,224 INFO L225 Difference]: With dead ends: 191 [2022-11-25 15:45:17,224 INFO L226 Difference]: Without dead ends: 191 [2022-11-25 15:45:17,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=894, Invalid=4821, Unknown=5, NotChecked=760, Total=6480 [2022-11-25 15:45:17,226 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 1111 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 1872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 678 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:17,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 939 Invalid, 1872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1174 Invalid, 0 Unknown, 678 Unchecked, 0.9s Time] [2022-11-25 15:45:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-25 15:45:17,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 90. [2022-11-25 15:45:17,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 89 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2022-11-25 15:45:17,230 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 44 [2022-11-25 15:45:17,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:17,231 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2022-11-25 15:45:17,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.1153846153846154) internal successors, (110), 53 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2022-11-25 15:45:17,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 15:45:17,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:17,232 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:17,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:17,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:45:17,432 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:45:17,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:17,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1958848316, now seen corresponding path program 2 times [2022-11-25 15:45:17,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:17,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473741869] [2022-11-25 15:45:17,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:17,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 15:45:17,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:17,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473741869] [2022-11-25 15:45:17,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473741869] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:45:17,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568615918] [2022-11-25 15:45:17,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:45:17,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:45:17,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:45:17,578 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:45:17,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 15:45:17,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:45:17,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:45:17,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:45:17,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:17,836 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-25 15:45:17,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:45:17,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568615918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:17,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 15:45:17,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2022-11-25 15:45:17,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637640502] [2022-11-25 15:45:17,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:17,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:45:17,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:17,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:45:17,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:45:17,838 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:17,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:17,886 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-11-25 15:45:17,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:45:17,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-11-25 15:45:17,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:17,887 INFO L225 Difference]: With dead ends: 76 [2022-11-25 15:45:17,887 INFO L226 Difference]: Without dead ends: 76 [2022-11-25 15:45:17,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:45:17,888 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 115 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:17,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 74 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:45:17,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-25 15:45:17,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-25 15:45:17,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.173913043478261) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:17,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2022-11-25 15:45:17,898 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 47 [2022-11-25 15:45:17,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:17,898 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2022-11-25 15:45:17,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:17,899 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-11-25 15:45:17,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 15:45:17,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:17,899 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:17,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:18,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:45:18,111 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:45:18,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:18,112 INFO L85 PathProgramCache]: Analyzing trace with hash -645325999, now seen corresponding path program 1 times [2022-11-25 15:45:18,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:18,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969769544] [2022-11-25 15:45:18,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:18,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:20,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:20,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969769544] [2022-11-25 15:45:20,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969769544] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:45:20,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217115724] [2022-11-25 15:45:20,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:20,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:45:20,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:45:20,143 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:45:20,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 15:45:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:20,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-25 15:45:20,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:20,387 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-25 15:45:20,580 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 15:45:20,580 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-25 15:45:20,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 15:45:20,747 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 6 treesize of output 5 [2022-11-25 15:45:21,272 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:45:21,273 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 66 treesize of output 63 [2022-11-25 15:45:21,280 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 33 treesize of output 23 [2022-11-25 15:45:21,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:45:21,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-11-25 15:45:21,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:45:21,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:45:21,506 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-11-25 15:45:21,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 30 treesize of output 32 [2022-11-25 15:45:21,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:45:21,532 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 34 [2022-11-25 15:45:21,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-11-25 15:45:21,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 15:45:21,930 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-25 15:45:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 15:45:22,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:45:23,149 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:45:23,149 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 46 treesize of output 47 [2022-11-25 15:45:23,162 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:45:23,162 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 98 treesize of output 101 [2022-11-25 15:45:23,173 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 37 treesize of output 23 [2022-11-25 15:45:23,239 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:45:23,239 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 46 treesize of output 47 [2022-11-25 15:45:23,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:45:23,253 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 98 treesize of output 101 [2022-11-25 15:45:23,261 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 37 treesize of output 23 [2022-11-25 15:45:23,331 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse0) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= .cse1 .cse2) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse0) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse0))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= .cse2 .cse1))) is different from false [2022-11-25 15:45:23,404 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse0))))) (<= .cse1 .cse2) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse0)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse0) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= .cse2 .cse1))) is different from false [2022-11-25 15:45:23,446 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2)) (.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2) (select (store (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse4) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse3 (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|)))))) is different from false [2022-11-25 15:45:23,538 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse2)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse2))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0)))) is different from false [2022-11-25 15:45:24,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:45:24,249 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 26 treesize of output 27 [2022-11-25 15:45:24,253 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 45 treesize of output 41 [2022-11-25 15:45:24,255 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:45:24,257 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 38 treesize of output 30 [2022-11-25 15:45:24,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:45:24,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-25 15:45:24,611 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-25 15:45:24,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217115724] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:45:24,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:45:24,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 73 [2022-11-25 15:45:24,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641019769] [2022-11-25 15:45:24,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:45:24,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-25 15:45:24,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:24,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-25 15:45:24,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4353, Unknown=109, NotChecked=548, Total=5256 [2022-11-25 15:45:24,616 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 73 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 73 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:28,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:28,673 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-11-25 15:45:28,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-25 15:45:28,673 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 73 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-25 15:45:28,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:28,674 INFO L225 Difference]: With dead ends: 83 [2022-11-25 15:45:28,674 INFO L226 Difference]: Without dead ends: 83 [2022-11-25 15:45:28,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 101 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2471 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=854, Invalid=8753, Unknown=111, NotChecked=788, Total=10506 [2022-11-25 15:45:28,677 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 246 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 2227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 327 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:28,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1132 Invalid, 2227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1889 Invalid, 2 Unknown, 327 Unchecked, 1.4s Time] [2022-11-25 15:45:28,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-25 15:45:28,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2022-11-25 15:45:28,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:28,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-11-25 15:45:28,680 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 48 [2022-11-25 15:45:28,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:28,680 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-11-25 15:45:28,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 73 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:28,681 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-11-25 15:45:28,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 15:45:28,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:28,681 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:28,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:28,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:45:28,888 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:45:28,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:28,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1693462380, now seen corresponding path program 1 times [2022-11-25 15:45:28,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:28,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134511644] [2022-11-25 15:45:28,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:28,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,496 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 15:45:29,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:29,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134511644] [2022-11-25 15:45:29,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134511644] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:45:29,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680448148] [2022-11-25 15:45:29,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:29,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:45:29,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:45:29,500 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:45:29,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 15:45:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-25 15:45:29,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:30,052 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 15 treesize of output 11 [2022-11-25 15:45:30,344 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-25 15:45:30,429 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 15:45:30,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:45:30,562 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 36 treesize of output 32 [2022-11-25 15:45:30,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:45:30,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:45:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 15:45:30,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680448148] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:45:30,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:45:30,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 12] total 34 [2022-11-25 15:45:30,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229880129] [2022-11-25 15:45:30,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:45:30,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-25 15:45:30,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:30,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 15:45:30,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 15:45:30,729 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 34 states, 34 states have (on average 3.9411764705882355) internal successors, (134), 34 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:31,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:31,980 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-11-25 15:45:31,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 15:45:31,983 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.9411764705882355) internal successors, (134), 34 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-11-25 15:45:31,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:31,984 INFO L225 Difference]: With dead ends: 99 [2022-11-25 15:45:31,984 INFO L226 Difference]: Without dead ends: 99 [2022-11-25 15:45:31,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=463, Invalid=2189, Unknown=0, NotChecked=0, Total=2652 [2022-11-25 15:45:31,985 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 822 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:31,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 463 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 15:45:31,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-25 15:45:31,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2022-11-25 15:45:31,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:31,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-25 15:45:31,988 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 55 [2022-11-25 15:45:31,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:31,989 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-25 15:45:31,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.9411764705882355) internal successors, (134), 34 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-25 15:45:31,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 15:45:31,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:31,990 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:31,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:32,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-25 15:45:32,196 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:45:32,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:32,197 INFO L85 PathProgramCache]: Analyzing trace with hash 261778123, now seen corresponding path program 2 times [2022-11-25 15:45:32,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:32,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957584729] [2022-11-25 15:45:32,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:32,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 15:45:32,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:32,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957584729] [2022-11-25 15:45:32,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957584729] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:45:32,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746663520] [2022-11-25 15:45:32,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:45:32,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:45:32,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:45:32,363 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:45:32,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 15:45:32,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:45:32,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:45:32,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:45:32,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:32,653 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 15:45:32,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:45:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 15:45:32,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746663520] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:45:32,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:45:32,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-25 15:45:32,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867649249] [2022-11-25 15:45:32,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:45:32,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:45:32,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:32,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:45:32,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:45:32,750 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:32,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:32,817 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-11-25 15:45:32,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:45:32,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-25 15:45:32,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:32,818 INFO L225 Difference]: With dead ends: 71 [2022-11-25 15:45:32,818 INFO L226 Difference]: Without dead ends: 71 [2022-11-25 15:45:32,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:45:32,819 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 82 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:32,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 148 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:45:32,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-25 15:45:32,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-25 15:45:32,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 70 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:32,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-11-25 15:45:32,821 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 58 [2022-11-25 15:45:32,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:32,821 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-11-25 15:45:32,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:32,822 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-11-25 15:45:32,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-25 15:45:32,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:32,822 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:32,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:33,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-25 15:45:33,028 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:45:33,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:33,028 INFO L85 PathProgramCache]: Analyzing trace with hash 187254194, now seen corresponding path program 1 times [2022-11-25 15:45:33,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:33,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252809499] [2022-11-25 15:45:33,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:33,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-25 15:45:33,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:33,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252809499] [2022-11-25 15:45:33,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252809499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:33,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:33,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 15:45:33,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206311392] [2022-11-25 15:45:33,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:33,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:45:33,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:33,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:45:33,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:45:33,189 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:33,391 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2022-11-25 15:45:33,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 15:45:33,392 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-11-25 15:45:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:33,392 INFO L225 Difference]: With dead ends: 82 [2022-11-25 15:45:33,392 INFO L226 Difference]: Without dead ends: 82 [2022-11-25 15:45:33,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:45:33,393 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 226 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:33,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 89 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:45:33,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-25 15:45:33,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2022-11-25 15:45:33,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:33,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-11-25 15:45:33,396 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 59 [2022-11-25 15:45:33,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:33,396 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-11-25 15:45:33,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:33,396 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-11-25 15:45:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-25 15:45:33,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:33,397 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:33,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 15:45:33,397 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:45:33,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:33,398 INFO L85 PathProgramCache]: Analyzing trace with hash 187254195, now seen corresponding path program 1 times [2022-11-25 15:45:33,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:33,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036137024] [2022-11-25 15:45:33,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:33,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 15:45:33,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:33,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036137024] [2022-11-25 15:45:33,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036137024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:33,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:33,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 15:45:33,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762329386] [2022-11-25 15:45:33,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:33,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:45:33,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:33,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:45:33,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:45:33,706 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:33,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:33,957 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-11-25 15:45:33,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:45:33,958 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-11-25 15:45:33,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:33,958 INFO L225 Difference]: With dead ends: 80 [2022-11-25 15:45:33,958 INFO L226 Difference]: Without dead ends: 80 [2022-11-25 15:45:33,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:45:33,959 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 290 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:33,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 52 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:45:33,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-25 15:45:33,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2022-11-25 15:45:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 73 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:33,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-11-25 15:45:33,961 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 59 [2022-11-25 15:45:33,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:33,961 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-11-25 15:45:33,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:33,962 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-11-25 15:45:33,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-25 15:45:33,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:33,962 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:33,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 15:45:33,963 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:45:33,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:33,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1509911310, now seen corresponding path program 1 times [2022-11-25 15:45:33,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:33,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522244643] [2022-11-25 15:45:33,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:33,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 15:45:34,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:34,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522244643] [2022-11-25 15:45:34,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522244643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:34,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:34,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 15:45:34,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529167074] [2022-11-25 15:45:34,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:34,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:45:34,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:34,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:45:34,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:45:34,103 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:34,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:34,257 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-11-25 15:45:34,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:45:34,257 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-11-25 15:45:34,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:34,258 INFO L225 Difference]: With dead ends: 77 [2022-11-25 15:45:34,258 INFO L226 Difference]: Without dead ends: 77 [2022-11-25 15:45:34,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:45:34,259 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 272 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:34,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 81 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:45:34,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-25 15:45:34,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2022-11-25 15:45:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:34,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-11-25 15:45:34,264 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 60 [2022-11-25 15:45:34,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:34,264 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-11-25 15:45:34,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-11-25 15:45:34,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-25 15:45:34,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:34,266 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:34,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 15:45:34,266 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:45:34,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:34,267 INFO L85 PathProgramCache]: Analyzing trace with hash -672727665, now seen corresponding path program 1 times [2022-11-25 15:45:34,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:34,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932888965] [2022-11-25 15:45:34,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:34,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:34,448 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 15:45:34,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:34,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932888965] [2022-11-25 15:45:34,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932888965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:34,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:34,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 15:45:34,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403352077] [2022-11-25 15:45:34,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:34,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:45:34,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:34,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:45:34,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:45:34,451 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:34,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:34,638 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-11-25 15:45:34,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:45:34,639 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-11-25 15:45:34,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:34,639 INFO L225 Difference]: With dead ends: 75 [2022-11-25 15:45:34,639 INFO L226 Difference]: Without dead ends: 75 [2022-11-25 15:45:34,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:45:34,640 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 255 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:34,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 65 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:45:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-25 15:45:34,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-11-25 15:45:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-11-25 15:45:34,642 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 62 [2022-11-25 15:45:34,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:34,643 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-11-25 15:45:34,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-11-25 15:45:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-25 15:45:34,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:34,644 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:34,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 15:45:34,644 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:45:34,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:34,645 INFO L85 PathProgramCache]: Analyzing trace with hash -912303337, now seen corresponding path program 1 times [2022-11-25 15:45:34,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:34,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825333443] [2022-11-25 15:45:34,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:34,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:35,928 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 15:45:35,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:35,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825333443] [2022-11-25 15:45:35,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825333443] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:45:35,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837747705] [2022-11-25 15:45:35,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:35,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:45:35,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:45:35,933 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:45:35,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 15:45:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:36,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-25 15:45:36,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:36,170 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-25 15:45:36,232 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 15:45:36,232 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-25 15:45:36,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 15:45:36,453 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:45:36,454 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 23 treesize of output 26 [2022-11-25 15:45:36,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:45:36,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-11-25 15:45:36,675 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:45:36,676 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 22 treesize of output 20 [2022-11-25 15:45:36,793 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:45:36,793 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-25 15:45:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 15:45:36,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:45:37,183 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_ArrVal_1845 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (= 1 (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4))))) is different from false [2022-11-25 15:45:37,516 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_ArrVal_1845 Int)) (or (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) is different from false [2022-11-25 15:45:37,530 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_ArrVal_1845 Int)) (or (= (select (store |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_1843) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) is different from false [2022-11-25 15:45:37,719 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_ArrVal_1845 Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (= (select (store |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_1843) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1))) is different from false [2022-11-25 15:45:37,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:45:37,729 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 28 treesize of output 29 [2022-11-25 15:45:37,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2022-11-25 15:45:37,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:45:37,746 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 42 treesize of output 44 [2022-11-25 15:45:37,753 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 32 treesize of output 30 [2022-11-25 15:45:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 6 not checked. [2022-11-25 15:45:38,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837747705] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:45:38,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:45:38,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 45 [2022-11-25 15:45:38,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672929566] [2022-11-25 15:45:38,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:45:38,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-25 15:45:38,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:38,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-25 15:45:38,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1541, Unknown=45, NotChecked=332, Total=2070 [2022-11-25 15:45:38,202 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 46 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 46 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:42,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:45:42,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:45:42,766 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-11-25 15:45:42,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-25 15:45:42,766 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 46 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-25 15:45:42,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:45:42,767 INFO L225 Difference]: With dead ends: 89 [2022-11-25 15:45:42,767 INFO L226 Difference]: Without dead ends: 89 [2022-11-25 15:45:42,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 103 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=670, Invalid=3723, Unknown=45, NotChecked=532, Total=4970 [2022-11-25 15:45:42,769 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 387 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 19 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-25 15:45:42,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 464 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 957 Invalid, 21 Unknown, 310 Unchecked, 2.9s Time] [2022-11-25 15:45:42,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-25 15:45:42,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2022-11-25 15:45:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:42,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2022-11-25 15:45:42,772 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 65 [2022-11-25 15:45:42,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:45:42,772 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2022-11-25 15:45:42,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 46 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:42,772 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2022-11-25 15:45:42,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-25 15:45:42,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:45:42,773 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:42,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:42,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-25 15:45:42,979 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:45:42,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:42,980 INFO L85 PathProgramCache]: Analyzing trace with hash -912303336, now seen corresponding path program 1 times [2022-11-25 15:45:42,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:42,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42682412] [2022-11-25 15:45:42,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:42,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:45,006 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 15:45:45,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:45,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42682412] [2022-11-25 15:45:45,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42682412] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:45:45,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528028784] [2022-11-25 15:45:45,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:45,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:45:45,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:45:45,009 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:45:45,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-25 15:45:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:45,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-25 15:45:45,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:45,258 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-25 15:45:45,265 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-25 15:45:45,474 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 15:45:45,474 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-25 15:45:45,512 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 15:45:45,512 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-25 15:45:45,705 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-25 15:45:45,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 15:45:46,221 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:45:46,222 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 42 treesize of output 41 [2022-11-25 15:45:46,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:45:46,234 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 20 treesize of output 22 [2022-11-25 15:45:46,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:45:46,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 15:45:46,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:45:46,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-11-25 15:45:46,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:45:46,911 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 24 treesize of output 18 [2022-11-25 15:45:46,927 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:45:46,927 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 27 treesize of output 21 [2022-11-25 15:45:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 15:45:47,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:45:52,612 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1964 Int)) (let ((.cse0 (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964))) (or (< (select .cse0 .cse1) 0) (forall ((v_ArrVal_1962 Int)) (<= (+ (select .cse0 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1961) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1962) 4))))))))) (forall ((v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1964 Int)) (let ((.cse2 (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964))) (or (< (select .cse2 .cse1) 0) (<= 0 (+ (select .cse2 4) 4))))))))) is different from false [2022-11-25 15:45:52,678 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1964 Int)) (let ((.cse0 (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964))) (or (< (select .cse0 .cse1) 0) (<= 0 (+ (select .cse0 4) 4))))))) (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1964 Int)) (let ((.cse2 (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964))) (or (forall ((v_ArrVal_1962 Int)) (<= (+ (select .cse2 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1961) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1962) 4)))) (< (select .cse2 .cse1) 0)))))))) is different from false [2022-11-25 15:45:57,505 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:45:57,506 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 131 treesize of output 102 [2022-11-25 15:45:57,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:45:57,515 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 91 treesize of output 92 [2022-11-25 15:45:57,521 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 120 treesize of output 116 [2022-11-25 15:45:57,527 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 214 treesize of output 202 [2022-11-25 15:45:57,534 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 231 treesize of output 227 [2022-11-25 15:45:57,552 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:45:57,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 288 treesize of output 287 [2022-11-25 15:45:57,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:45:57,575 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 334 treesize of output 332 [2022-11-25 15:45:57,600 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:45:57,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 424 treesize of output 410 [2022-11-25 15:45:57,622 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:45:57,623 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 423 treesize of output 426 [2022-11-25 15:46:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 3 not checked. [2022-11-25 15:46:03,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528028784] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:46:03,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:46:03,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 27] total 71 [2022-11-25 15:46:03,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87436149] [2022-11-25 15:46:03,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:46:03,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-25 15:46:03,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:46:03,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-25 15:46:03,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=4527, Unknown=23, NotChecked=274, Total=5112 [2022-11-25 15:46:03,994 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 72 states, 71 states have (on average 2.3661971830985915) internal successors, (168), 72 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:15,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:46:15,662 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2022-11-25 15:46:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-25 15:46:15,663 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 2.3661971830985915) internal successors, (168), 72 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-25 15:46:15,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:46:15,664 INFO L225 Difference]: With dead ends: 90 [2022-11-25 15:46:15,664 INFO L226 Difference]: Without dead ends: 90 [2022-11-25 15:46:15,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1879 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=1377, Invalid=8508, Unknown=23, NotChecked=394, Total=10302 [2022-11-25 15:46:15,666 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 926 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:46:15,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 599 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1366 Invalid, 0 Unknown, 166 Unchecked, 1.5s Time] [2022-11-25 15:46:15,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-25 15:46:15,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2022-11-25 15:46:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.12) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:15,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-25 15:46:15,668 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 65 [2022-11-25 15:46:15,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:46:15,669 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-25 15:46:15,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 2.3661971830985915) internal successors, (168), 72 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:15,669 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-25 15:46:15,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 15:46:15,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:15,670 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:15,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-25 15:46:15,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-25 15:46:15,876 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:46:15,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:15,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1783366217, now seen corresponding path program 1 times [2022-11-25 15:46:15,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:46:15,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347198796] [2022-11-25 15:46:15,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:15,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:46:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 15:46:17,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:46:17,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347198796] [2022-11-25 15:46:17,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347198796] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:46:17,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694473824] [2022-11-25 15:46:17,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:17,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:46:17,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:46:17,489 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:46:17,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-25 15:46:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:17,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-25 15:46:17,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:18,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 15:46:19,136 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 15:46:19,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 56 [2022-11-25 15:46:19,147 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:46:19,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-11-25 15:46:19,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:46:19,550 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 72 treesize of output 59 [2022-11-25 15:46:20,493 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:46:20,493 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 70 treesize of output 56 [2022-11-25 15:46:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 15:46:21,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:46:23,635 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:46:23,635 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 24 treesize of output 25 [2022-11-25 15:46:23,639 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 41 treesize of output 37 [2022-11-25 15:46:23,651 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:46:23,652 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 48 treesize of output 50 [2022-11-25 15:46:23,668 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 46 [2022-11-25 15:46:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 15:46:24,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694473824] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:46:24,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:46:24,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2022-11-25 15:46:24,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112231252] [2022-11-25 15:46:24,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:46:24,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-25 15:46:24,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:46:24,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-25 15:46:24,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=4820, Unknown=11, NotChecked=0, Total=5112 [2022-11-25 15:46:24,782 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 72 states, 72 states have (on average 2.486111111111111) internal successors, (179), 72 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:36,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:46:36,051 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-11-25 15:46:36,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-25 15:46:36,051 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.486111111111111) internal successors, (179), 72 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-11-25 15:46:36,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:46:36,052 INFO L225 Difference]: With dead ends: 141 [2022-11-25 15:46:36,052 INFO L226 Difference]: Without dead ends: 141 [2022-11-25 15:46:36,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2337 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=1421, Invalid=12140, Unknown=11, NotChecked=0, Total=13572 [2022-11-25 15:46:36,054 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 1239 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 66 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:46:36,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1239 Valid, 894 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1533 Invalid, 5 Unknown, 0 Unchecked, 2.2s Time] [2022-11-25 15:46:36,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-25 15:46:36,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 80. [2022-11-25 15:46:36,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-11-25 15:46:36,057 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 66 [2022-11-25 15:46:36,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:46:36,057 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-11-25 15:46:36,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.486111111111111) internal successors, (179), 72 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:36,058 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-11-25 15:46:36,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 15:46:36,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:36,059 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:36,066 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-11-25 15:46:36,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:46:36,265 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:46:36,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:36,266 INFO L85 PathProgramCache]: Analyzing trace with hash 124432906, now seen corresponding path program 1 times [2022-11-25 15:46:36,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:46:36,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840695373] [2022-11-25 15:46:36,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:36,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:46:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 15:46:37,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:46:37,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840695373] [2022-11-25 15:46:37,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840695373] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:46:37,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850371482] [2022-11-25 15:46:37,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:37,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:46:37,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:46:37,681 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:46:37,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-25 15:46:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:37,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-25 15:46:37,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:37,945 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-25 15:46:38,032 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 15:46:38,032 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-25 15:46:38,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 15:46:38,316 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:46:38,317 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-25 15:46:38,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:46:38,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-11-25 15:46:38,592 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:46:38,593 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 27 treesize of output 21 [2022-11-25 15:46:38,701 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 15:46:38,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:46:39,219 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (< (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2189) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-25 15:46:39,236 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2189) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2022-11-25 15:46:39,413 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2189) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-25 15:46:39,425 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2189) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-25 15:46:39,609 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2189) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2022-11-25 15:46:39,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:46:39,620 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 23 treesize of output 24 [2022-11-25 15:46:39,625 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 38 treesize of output 34 [2022-11-25 15:46:39,641 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:46:39,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 15:46:39,650 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 22 treesize of output 20 [2022-11-25 15:46:40,108 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 6 not checked. [2022-11-25 15:46:40,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850371482] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:46:40,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:46:40,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 23] total 46 [2022-11-25 15:46:40,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519775652] [2022-11-25 15:46:40,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:46:40,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-25 15:46:40,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:46:40,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-25 15:46:40,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1553, Unknown=39, NotChecked=420, Total=2162 [2022-11-25 15:46:40,110 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 47 states, 46 states have (on average 3.0) internal successors, (138), 47 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:44,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:46:44,195 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2022-11-25 15:46:44,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-25 15:46:44,196 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 3.0) internal successors, (138), 47 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-11-25 15:46:44,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:46:44,196 INFO L225 Difference]: With dead ends: 88 [2022-11-25 15:46:44,196 INFO L226 Difference]: Without dead ends: 88 [2022-11-25 15:46:44,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 106 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=778, Invalid=4033, Unknown=39, NotChecked=700, Total=5550 [2022-11-25 15:46:44,198 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 384 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 14 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 370 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:46:44,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 608 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1068 Invalid, 7 Unknown, 370 Unchecked, 1.0s Time] [2022-11-25 15:46:44,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-25 15:46:44,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2022-11-25 15:46:44,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.105263157894737) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2022-11-25 15:46:44,200 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 68 [2022-11-25 15:46:44,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:46:44,200 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2022-11-25 15:46:44,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.0) internal successors, (138), 47 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-11-25 15:46:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-25 15:46:44,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:44,201 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:44,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-25 15:46:44,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:46:44,404 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-25 15:46:44,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:44,404 INFO L85 PathProgramCache]: Analyzing trace with hash 424087740, now seen corresponding path program 2 times [2022-11-25 15:46:44,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:46:44,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197555263] [2022-11-25 15:46:44,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:44,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:46:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 15:46:47,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:46:47,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197555263] [2022-11-25 15:46:47,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197555263] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:46:47,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114008186] [2022-11-25 15:46:47,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:46:47,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:46:47,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:46:47,837 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:46:47,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_776f7b76-6353-4786-a3e5-aa8af043f0a4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-25 15:46:48,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:46:48,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:46:48,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 138 conjunts are in the unsatisfiable core [2022-11-25 15:46:48,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:48,099 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-25 15:46:48,190 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-25 15:46:48,198 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-25 15:46:48,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:46:48,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 15:46:48,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:46:48,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 15:46:48,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:46:48,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-25 15:46:48,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:46:48,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-25 15:46:48,399 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 15:46:48,399 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-25 15:46:48,431 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-25 15:46:48,438 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-25 15:46:48,456 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-25 15:46:48,464 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-25 15:46:48,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 15:46:48,521 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 27 treesize of output 26 [2022-11-25 15:46:49,221 INFO L321 Elim1Store]: treesize reduction 98, result has 41.0 percent of original size [2022-11-25 15:46:49,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 118 [2022-11-25 15:46:49,301 INFO L321 Elim1Store]: treesize reduction 52, result has 52.7 percent of original size [2022-11-25 15:46:49,302 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 123 [2022-11-25 15:46:50,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:46:50,160 INFO L321 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2022-11-25 15:46:50,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 121 [2022-11-25 15:46:50,219 INFO L321 Elim1Store]: treesize reduction 40, result has 54.0 percent of original size [2022-11-25 15:46:50,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 129 treesize of output 158 [2022-11-25 15:46:50,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 15:46:50,383 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 15:46:50,384 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 11 [2022-11-25 15:46:50,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 15:46:52,649 INFO L321 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2022-11-25 15:46:52,650 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 57 treesize of output 38 [2022-11-25 15:46:52,662 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:46:52,662 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 17 treesize of output 15 [2022-11-25 15:46:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 15:46:52,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:47:09,495 INFO L321 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2022-11-25 15:47:09,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 246 treesize of output 193 [2022-11-25 15:47:09,503 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 286 treesize of output 274 [2022-11-25 15:47:09,770 INFO L321 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2022-11-25 15:47:09,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 194 treesize of output 189 [2022-11-25 15:47:09,878 INFO L321 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2022-11-25 15:47:09,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 254 treesize of output 217 [2022-11-25 15:47:13,512 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse37 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (let ((.cse0 (not .cse37)) (.cse14 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse87 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse85 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (let ((.cse86 (select .cse85 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse88 (select .cse87 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse85 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse86 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse87 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse88 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse85 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse86 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse87 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse88 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (.cse17 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (= (select (select (store (let ((.cse83 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse83 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse83 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse84 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse84 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse84 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (and (or .cse0 (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimCell_138 Int)) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (or (= (select (select (store (store .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (let ((.cse4 (select v_arrayElimArr_11 4))) (select (store (store .cse2 v_arrayElimCell_138 (store (select .cse2 v_arrayElimCell_138) .cse4 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse3 v_arrayElimCell_138 (store (select .cse3 v_arrayElimCell_138) .cse4 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimCell_138 Int)) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (let ((.cse6 (select .cse5 v_arrayElimCell_138)) (.cse8 (select .cse7 v_arrayElimCell_138)) (.cse9 (select .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse10 (select .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse5 v_arrayElimCell_138 (store .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse7 v_arrayElimCell_138 (store .cse8 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse5 v_arrayElimCell_138 (store .cse6 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse7 v_arrayElimCell_138 (store .cse8 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse9 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse10 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_138 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (or (= (select (select (store (store .cse11 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select (let ((.cse13 (select v_arrayElimArr_11 4))) (select (store (store .cse11 v_arrayElimCell_138 (store (select .cse11 v_arrayElimCell_138) .cse13 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse12 v_arrayElimCell_138 (store (select .cse12 v_arrayElimCell_138) .cse13 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) .cse14 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (= (select (select (store (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse15 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse16 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) .cse17 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimCell_138 Int)) (or (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse21 (select .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse18 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse19 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse21 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse18 v_arrayElimCell_138 (store (select .cse18 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse20 v_arrayElimCell_138 (store (select .cse20 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse18 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse19 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse21 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))))))))) (forall ((v_arrayElimArr_10 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (forall ((v_arrayElimCell_136 Int)) (or (= (select (let ((.cse22 (store .cse24 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse25 v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse22 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse23 0 v_ArrVal_2326)) (select .cse23 4)))) 4) 0) (= (select (let ((.cse26 (let ((.cse28 (select v_arrayElimArr_10 4))) (store .cse24 .cse28 (store (select .cse24 .cse28) v_arrayElimCell_136 v_ArrVal_2322))))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse26 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse27 0 v_ArrVal_2326)) (select .cse27 4)))) 4) 0))) (= (select (let ((.cse29 (store .cse24 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse25 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse29 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse30 0 v_ArrVal_2326)) (select .cse30 4)))) 4) 0))))) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int) (v_arrayElimCell_136 Int)) (let ((.cse33 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (or (= (select (let ((.cse31 (store .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base|) v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse31 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse32 0 v_ArrVal_2326)) (select .cse32 4)))) 4) 0) (= (select (let ((.cse34 (let ((.cse36 (select v_arrayElimArr_10 4))) (store .cse33 .cse36 (store (select .cse33 .cse36) v_arrayElimCell_136 v_ArrVal_2322))))) (let ((.cse35 (select .cse34 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse34 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse35 0 v_ArrVal_2326)) (select .cse35 4)))) 4) 0) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) .cse37) (or .cse0 (and (forall ((v_arrayElimArr_10 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int) (v_arrayElimCell_135 Int) (v_ArrVal_2326 Int)) (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (let ((.cse38 (store .cse40 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse41 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse38 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse39 0 v_ArrVal_2326)) (select .cse39 4)))) 4) 0) (forall ((v_arrayElimCell_136 Int)) (or (= (select (let ((.cse42 (store .cse40 v_arrayElimCell_135 (store (select .cse40 v_arrayElimCell_135) v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse42 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse43 0 v_ArrVal_2326)) (select .cse43 4)))) 4) 0) (= (select (let ((.cse44 (store .cse40 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse41 v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse45 (select .cse44 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse44 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse45 0 v_ArrVal_2326)) (select .cse45 4)))) 4) 0))))))) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (forall ((v_arrayElimArr_10 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (= (select (let ((.cse46 (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (store .cse48 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse48 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))))) (let ((.cse47 (select .cse46 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse46 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse47 0 v_ArrVal_2326)) (select .cse47 4)))) 4) 0)) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (or .cse37 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (= (select (let ((.cse50 (select v_arrayElimArr_12 4)) (.cse51 (select v_arrayElimArr_11 4))) (select (store (let ((.cse49 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse49 .cse50 (store (select .cse49 .cse50) .cse51 v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse52 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse52 .cse50 (store (select .cse52 .cse50) .cse51 v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (or .cse0 (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (or (= (select (let ((.cse53 (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (store .cse55 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse55 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse53 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse54 0 v_ArrVal_2326)) (select .cse54 4)))) 4) 0) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse59 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse56 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse61 (select v_arrayElimArr_12 4))) (let ((.cse62 (select .cse56 .cse61)) (.cse63 (select .cse59 .cse61)) (.cse58 (select v_arrayElimArr_11 4)) (.cse57 (select .cse56 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse60 (select .cse59 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse56 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse57 .cse58 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse59 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse60 .cse58 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse56 .cse61 (store .cse62 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse59 .cse61 (store .cse63 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse56 .cse61 (store .cse62 .cse58 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse59 .cse61 (store .cse63 .cse58 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse56 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse57 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse59 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse60 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (or .cse37 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse64 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse66 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse65 (select v_arrayElimArr_11 4))) (or (= (select (select (store (store .cse64 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse64 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse65 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse66 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse66 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse65 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (let ((.cse67 (select v_arrayElimArr_12 4))) (select (store (store .cse64 .cse67 (store (select .cse64 .cse67) .cse65 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse66 .cse67 (store (select .cse66 .cse67) .cse65 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (or .cse0 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (= (select (select (store (let ((.cse68 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse68 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse68 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse69 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse69 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse69 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int) (v_arrayElimCell_136 Int)) (or (= (select (let ((.cse70 (let ((.cse72 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10)) (.cse73 (select v_arrayElimArr_10 4))) (store .cse72 .cse73 (store (select .cse72 .cse73) v_arrayElimCell_136 v_ArrVal_2322))))) (let ((.cse71 (select .cse70 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse70 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse71 0 v_ArrVal_2326)) (select .cse71 4)))) 4) 0) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) .cse37) (or .cse0 (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse74 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse75 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (or (= (select (select (store (store .cse74 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse74 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse75 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse75 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (let ((.cse76 (select v_arrayElimArr_12 4))) (select (store (store .cse74 .cse76 (store (select .cse74 .cse76) v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse75 .cse76 (store (select .cse75 .cse76) v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))))) .cse14 .cse17)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse79 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse77 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse80 (select v_arrayElimArr_12 4))) (let ((.cse81 (select .cse77 .cse80)) (.cse82 (select .cse79 .cse80)) (.cse78 (select v_arrayElimArr_11 4))) (or (= (select (select (store (store .cse77 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse77 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse78 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse79 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse79 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse78 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse77 .cse80 (store .cse81 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse79 .cse80 (store .cse82 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse77 .cse80 (store .cse81 .cse78 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse79 .cse80 (store .cse82 .cse78 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) .cse37)))) (not (<= 0 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) is different from true [2022-11-25 15:48:18,901 WARN L233 SmtUtils]: Spent 11.26s on a formula simplification. DAG size of input: 244 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:48:20,771 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 4) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimCell_138 Int)) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse2 (store .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_12)) (.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_11))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse3 (select .cse2 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse1 v_arrayElimCell_137 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse2 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse3 v_arrayElimCell_137 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (= (select (select (store (store .cse0 v_arrayElimCell_138 (store (select .cse0 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse2 v_arrayElimCell_138 (store (select .cse2 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (= (select (select (store (store .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse1 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse2 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0))))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 4))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_10 4))) (or (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse6)) (forall ((v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (let ((.cse9 (store .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_10))) (or (forall ((v_arrayElimCell_136 Int)) (= (select (let ((.cse7 (store .cse9 .cse6 (store (select .cse9 .cse6) v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse8 (select .cse7 |v_ULTIMATE.start_node_create_~temp~0#1.base_37|))) (select (store .cse7 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| (store .cse8 0 v_ArrVal_2326)) (select .cse8 4)))) 4) 0)) (= (select (let ((.cse10 (store .cse9 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_2322)))) (let ((.cse11 (select .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_37|))) (select (store .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| (store .cse11 0 v_ArrVal_2326)) (select .cse11 4)))) 4) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0))))))) is different from false [2022-11-25 15:48:20,879 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 4) |c_ULTIMATE.start_node_create_#res#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimCell_138 Int)) (or (not (= |c_ULTIMATE.start_node_create_#res#1.offset| (select v_arrayElimArr_11 4))) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse2 (store .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_12)) (.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_11))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_node_create_#res#1.base|)) (.cse3 (select .cse2 |c_ULTIMATE.start_node_create_#res#1.base|))) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_node_create_#res#1.base| (store .cse1 |c_ULTIMATE.start_node_create_#res#1.offset| v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse2 |c_ULTIMATE.start_node_create_#res#1.base| (store .cse3 |c_ULTIMATE.start_node_create_#res#1.offset| v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (= (select (select (store (store .cse0 |c_ULTIMATE.start_node_create_#res#1.base| (store .cse1 v_arrayElimCell_137 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse2 |c_ULTIMATE.start_node_create_#res#1.base| (store .cse3 v_arrayElimCell_137 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (= (select (select (store (store .cse0 v_arrayElimCell_138 (store (select .cse0 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse2 v_arrayElimCell_138 (store (select .cse2 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_10 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_10 4))) (or (not (= |c_ULTIMATE.start_node_create_#res#1.base| .cse6)) (forall ((v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (let ((.cse9 (store .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_10))) (or (= (select (let ((.cse7 (store .cse9 |c_ULTIMATE.start_node_create_#res#1.base| (store (select .cse9 |c_ULTIMATE.start_node_create_#res#1.base|) |c_ULTIMATE.start_node_create_#res#1.offset| v_ArrVal_2322)))) (let ((.cse8 (select .cse7 |v_ULTIMATE.start_node_create_~temp~0#1.base_37|))) (select (store .cse7 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| (store .cse8 0 v_ArrVal_2326)) (select .cse8 4)))) 4) 0) (forall ((v_arrayElimCell_136 Int)) (= (select (let ((.cse10 (store .cse9 .cse6 (store (select .cse9 .cse6) v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse11 (select .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_37|))) (select (store .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| (store .cse11 0 v_ArrVal_2326)) (select .cse11 4)))) 4) 0))))))))))))) is different from false [2022-11-25 15:48:21,009 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 4) |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimCell_138 Int)) (or (not (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select v_arrayElimArr_11 4))) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse2 (store .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_12)) (.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_11))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (.cse3 (select .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse1 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse3 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (= (select (select (store (store .cse0 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse1 v_arrayElimCell_137 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse3 v_arrayElimCell_137 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (= (select (select (store (store .cse0 v_arrayElimCell_138 (store (select .cse0 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse2 v_arrayElimCell_138 (store (select .cse2 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0))))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_10 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_10 4))) (or (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse6)) (forall ((v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (let ((.cse9 (store .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_10))) (or (= (select (let ((.cse7 (store .cse9 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (select .cse9 |c_ULTIMATE.start_node_create_~temp~0#1.base|) |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_2322)))) (let ((.cse8 (select .cse7 |v_ULTIMATE.start_node_create_~temp~0#1.base_37|))) (select (store .cse7 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| (store .cse8 0 v_ArrVal_2326)) (select .cse8 4)))) 4) 0) (forall ((v_arrayElimCell_136 Int)) (= (select (let ((.cse10 (store .cse9 .cse6 (store (select .cse9 .cse6) v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse11 (select .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_37|))) (select (store .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| (store .cse11 0 v_ArrVal_2326)) (select .cse11 4)))) 4) 0))))))))))))) is different from false [2022-11-25 15:48:21,156 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (.cse7 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int) (v_ArrVal_2307 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_10 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_10 4))) (or (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse0)) (forall ((v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store .cse6 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_2307) .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_10))) (or (= (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (select .cse3 |c_ULTIMATE.start_node_create_~temp~0#1.base|) |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_2322)))) (let ((.cse2 (select .cse1 |v_ULTIMATE.start_node_create_~temp~0#1.base_37|))) (select (store .cse1 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| (store .cse2 0 v_ArrVal_2326)) (select .cse2 4)))) 4) 0) (forall ((v_arrayElimCell_136 Int)) (= (select (let ((.cse4 (store .cse3 .cse0 (store (select .cse3 .cse0) v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse5 (select .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_37|))) (select (store .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| (store .cse5 0 v_ArrVal_2326)) (select .cse5 4)))) 4) 0)))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int) (v_ArrVal_2305 Int) (v_ArrVal_2307 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 4) |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimCell_138 Int)) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store .cse6 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_2307) .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_12)) (.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_2305) .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_11))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (.cse11 (select .cse10 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (or (= (select (select (store (store .cse8 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse9 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse10 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse11 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (= (select (select (store (store .cse8 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse9 v_arrayElimCell_137 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse10 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse11 v_arrayElimCell_137 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (= (select (select (store (store .cse8 v_arrayElimCell_138 (store (select .cse8 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse10 v_arrayElimCell_138 (store (select .cse10 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0))))) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select v_arrayElimArr_11 4))))))))))) is different from false [2022-11-25 15:48:21,260 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:48:21,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 351 treesize of output 153 [2022-11-25 15:48:21,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:48:21,444 INFO L321 Elim1Store]: treesize reduction 60, result has 50.4 percent of original size [2022-11-25 15:48:21,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 10533 treesize of output 9401 [2022-11-25 15:48:21,561 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 14537 treesize of output 13343 [2022-11-25 15:48:23,764 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 1380 treesize of output 1364 [2022-11-25 15:48:27,331 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-25 15:48:27,752 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 3508 treesize of output 3472 [2022-11-25 15:48:28,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3482 treesize of output 3448 [2022-11-25 15:49:55,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:49:55,072 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 598 treesize of output 540 [2022-11-25 15:49:55,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:49:55,249 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:49:55,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 253 [2022-11-25 15:49:55,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:49:55,287 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:49:55,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 235 treesize of output 145 [2022-11-25 15:49:55,587 INFO L321 Elim1Store]: treesize reduction 26, result has 91.2 percent of original size [2022-11-25 15:49:55,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 8028 treesize of output 7896 [2022-11-25 15:49:55,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:49:55,683 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 19770 treesize of output 19142 [2022-11-25 15:49:55,911 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 22231 treesize of output 20399 [2022-11-25 15:49:56,451 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 13508 treesize of output 13356 [2022-11-25 15:49:56,601 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 13642 treesize of output 13546 [2022-11-25 15:49:59,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:50:01,815 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 451 treesize of output 447 [2022-11-25 15:50:02,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-25 15:50:02,779 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-25 15:50:03,761 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:50:03,762 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 345 treesize of output 339 [2022-11-25 15:50:05,251 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 335 treesize of output 327 [2022-11-25 15:50:05,625 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 335 treesize of output 327 [2022-11-25 15:50:06,669 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 335 treesize of output 327 [2022-11-25 15:50:07,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:50:07,079 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:50:07,079 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 29 treesize of output 31 [2022-11-25 15:50:07,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:50:07,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:50:07,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-11-25 15:50:07,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:50:07,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:50:07,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2022-11-25 15:50:08,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:50:08,162 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:50:08,163 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 29 treesize of output 1 [2022-11-25 15:50:08,511 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:50:08,511 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 729 treesize of output 725 [2022-11-25 15:50:09,039 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:50:09,040 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 8677 treesize of output 8653 [2022-11-25 15:50:09,103 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:50:09,104 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 9968 treesize of output 9716