./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b4637ab5710a1ca22a981e8047278048fbbf856825d3649b2cb9d48de11d175 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:43:14,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:43:14,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:43:14,067 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:43:14,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:43:14,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:43:14,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:43:14,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:43:14,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:43:14,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:43:14,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:43:14,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:43:14,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:43:14,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:43:14,099 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:43:14,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:43:14,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:43:14,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:43:14,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:43:14,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:43:14,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:43:14,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:43:14,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:43:14,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:43:14,132 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:43:14,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:43:14,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:43:14,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:43:14,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:43:14,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:43:14,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:43:14,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:43:14,142 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:43:14,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:43:14,144 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:43:14,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:43:14,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:43:14,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:43:14,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:43:14,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:43:14,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:43:14,149 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:43:14,197 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:43:14,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:43:14,198 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:43:14,199 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:43:14,200 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:43:14,200 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:43:14,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:43:14,201 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:43:14,202 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:43:14,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:43:14,203 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:43:14,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:43:14,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:43:14,204 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:43:14,204 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:43:14,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:43:14,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:43:14,205 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:43:14,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:43:14,206 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:43:14,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:43:14,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:43:14,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:43:14,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:43:14,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:43:14,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:43:14,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:43:14,208 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:43:14,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:43:14,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:43:14,208 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:43:14,209 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:43:14,209 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:43:14,209 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 3b4637ab5710a1ca22a981e8047278048fbbf856825d3649b2cb9d48de11d175 [2022-11-02 20:43:14,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:43:14,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:43:14,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:43:14,637 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:43:14,639 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:43:14,641 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i [2022-11-02 20:43:14,745 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/data/d29791c21/d8c6f48fb07e47c9a0e43b4b79de65a3/FLAG0f03d637a [2022-11-02 20:43:15,423 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:43:15,424 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i [2022-11-02 20:43:15,437 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/data/d29791c21/d8c6f48fb07e47c9a0e43b4b79de65a3/FLAG0f03d637a [2022-11-02 20:43:15,745 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/data/d29791c21/d8c6f48fb07e47c9a0e43b4b79de65a3 [2022-11-02 20:43:15,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:43:15,750 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:43:15,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:43:15,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:43:15,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:43:15,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:43:15" (1/1) ... [2022-11-02 20:43:15,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@937cae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:15, skipping insertion in model container [2022-11-02 20:43:15,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:43:15" (1/1) ... [2022-11-02 20:43:15,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:43:15,808 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:43:16,184 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i[23974,23987] [2022-11-02 20:43:16,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:43:16,213 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:43:16,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i[23974,23987] [2022-11-02 20:43:16,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:43:16,332 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:43:16,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:16 WrapperNode [2022-11-02 20:43:16,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:43:16,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:43:16,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:43:16,335 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:43:16,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:16" (1/1) ... [2022-11-02 20:43:16,381 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:16" (1/1) ... [2022-11-02 20:43:16,421 INFO L138 Inliner]: procedures = 122, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 108 [2022-11-02 20:43:16,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:43:16,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:43:16,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:43:16,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:43:16,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:16" (1/1) ... [2022-11-02 20:43:16,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:16" (1/1) ... [2022-11-02 20:43:16,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:16" (1/1) ... [2022-11-02 20:43:16,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:16" (1/1) ... [2022-11-02 20:43:16,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:16" (1/1) ... [2022-11-02 20:43:16,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:16" (1/1) ... [2022-11-02 20:43:16,480 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:16" (1/1) ... [2022-11-02 20:43:16,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:16" (1/1) ... [2022-11-02 20:43:16,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:43:16,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:43:16,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:43:16,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:43:16,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:16" (1/1) ... [2022-11-02 20:43:16,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:43:16,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:16,532 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:16,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:43:16,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:43:16,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:43:16,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:43:16,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:43:16,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:43:16,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:43:16,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:43:16,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:43:16,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:43:16,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:43:16,724 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:43:16,727 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:43:17,042 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:43:17,049 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:43:17,050 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:43:17,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:43:17 BoogieIcfgContainer [2022-11-02 20:43:17,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:43:17,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:43:17,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:43:17,059 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:43:17,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:43:15" (1/3) ... [2022-11-02 20:43:17,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d24c9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:43:17, skipping insertion in model container [2022-11-02 20:43:17,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:16" (2/3) ... [2022-11-02 20:43:17,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d24c9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:43:17, skipping insertion in model container [2022-11-02 20:43:17,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:43:17" (3/3) ... [2022-11-02 20:43:17,062 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nullified-2.i [2022-11-02 20:43:17,084 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:43:17,085 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:43:17,167 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:43:17,185 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@697d47a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:43:17,185 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:43:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.6) internal successors, (40), 26 states have internal predecessors, (40), 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-02 20:43:17,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:43:17,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:17,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:17,202 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:17,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:17,212 INFO L85 PathProgramCache]: Analyzing trace with hash -91270904, now seen corresponding path program 1 times [2022-11-02 20:43:17,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:17,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37224663] [2022-11-02 20:43:17,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:17,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:17,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:17,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:17,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37224663] [2022-11-02 20:43:17,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37224663] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:17,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:17,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:17,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179603975] [2022-11-02 20:43:17,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:17,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:17,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:17,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:17,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:17,647 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.6) internal successors, (40), 26 states have internal predecessors, (40), 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, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-02 20:43:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:17,682 INFO L93 Difference]: Finished difference Result 52 states and 78 transitions. [2022-11-02 20:43:17,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:17,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2022-11-02 20:43:17,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:17,694 INFO L225 Difference]: With dead ends: 52 [2022-11-02 20:43:17,694 INFO L226 Difference]: Without dead ends: 27 [2022-11-02 20:43:17,698 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-02 20:43:17,702 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 66 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-02 20:43:17,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 66 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:17,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-02 20:43:17,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-11-02 20:43:17,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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-02 20:43:17,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-11-02 20:43:17,745 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2022-11-02 20:43:17,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:17,746 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-11-02 20:43:17,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-02 20:43:17,748 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-11-02 20:43:17,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:43:17,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:17,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:17,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:43:17,750 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:17,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:17,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1034399597, now seen corresponding path program 1 times [2022-11-02 20:43:17,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:17,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022396618] [2022-11-02 20:43:17,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:17,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:18,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:18,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022396618] [2022-11-02 20:43:18,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022396618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:18,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:18,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:18,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424653311] [2022-11-02 20:43:18,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:18,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:18,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:18,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:18,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:18,018 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-02 20:43:18,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:18,088 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-11-02 20:43:18,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:18,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 17 [2022-11-02 20:43:18,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:18,090 INFO L225 Difference]: With dead ends: 47 [2022-11-02 20:43:18,090 INFO L226 Difference]: Without dead ends: 27 [2022-11-02 20:43:18,091 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-02 20:43:18,092 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:18,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:43:18,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-02 20:43:18,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-11-02 20:43:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 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-02 20:43:18,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-11-02 20:43:18,100 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 17 [2022-11-02 20:43:18,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:18,100 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-11-02 20:43:18,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-02 20:43:18,101 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-11-02 20:43:18,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:43:18,102 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:18,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:18,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:43:18,103 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:18,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:18,103 INFO L85 PathProgramCache]: Analyzing trace with hash -776234159, now seen corresponding path program 1 times [2022-11-02 20:43:18,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:18,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293190469] [2022-11-02 20:43:18,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:18,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:18,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:18,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:18,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293190469] [2022-11-02 20:43:18,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293190469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:18,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:18,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:43:18,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130758092] [2022-11-02 20:43:18,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:18,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:43:18,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:18,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:43:18,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:43:18,619 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-02 20:43:19,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:19,039 INFO L93 Difference]: Finished difference Result 71 states and 98 transitions. [2022-11-02 20:43:19,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:43:19,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 17 [2022-11-02 20:43:19,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:19,040 INFO L225 Difference]: With dead ends: 71 [2022-11-02 20:43:19,041 INFO L226 Difference]: Without dead ends: 58 [2022-11-02 20:43:19,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:43:19,042 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 125 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:19,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 109 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:43:19,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-02 20:43:19,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 33. [2022-11-02 20:43:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 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-02 20:43:19,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-11-02 20:43:19,051 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 17 [2022-11-02 20:43:19,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:19,051 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-11-02 20:43:19,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-02 20:43:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-11-02 20:43:19,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:43:19,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:19,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:19,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:43:19,053 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:19,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:19,054 INFO L85 PathProgramCache]: Analyzing trace with hash -774387117, now seen corresponding path program 1 times [2022-11-02 20:43:19,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:19,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659558358] [2022-11-02 20:43:19,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:19,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:19,143 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-02 20:43:19,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:19,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659558358] [2022-11-02 20:43:19,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659558358] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:19,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624269005] [2022-11-02 20:43:19,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:19,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:19,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:19,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:19,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:43:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:19,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:43:19,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:19,345 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-02 20:43:19,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:19,393 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-02 20:43:19,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624269005] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:19,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:43:19,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-02 20:43:19,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803010967] [2022-11-02 20:43:19,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:19,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:43:19,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:19,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:43:19,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:43:19,402 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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-02 20:43:19,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:19,443 INFO L93 Difference]: Finished difference Result 69 states and 93 transitions. [2022-11-02 20:43:19,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:43:19,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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 17 [2022-11-02 20:43:19,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:19,451 INFO L225 Difference]: With dead ends: 69 [2022-11-02 20:43:19,451 INFO L226 Difference]: Without dead ends: 49 [2022-11-02 20:43:19,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:43:19,454 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 19 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:19,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 106 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:19,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-02 20:43:19,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-11-02 20:43:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 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-02 20:43:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-11-02 20:43:19,462 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 17 [2022-11-02 20:43:19,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:19,462 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-11-02 20:43:19,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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-02 20:43:19,462 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-11-02 20:43:19,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:43:19,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:19,463 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:19,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:19,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:19,664 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:19,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:19,665 INFO L85 PathProgramCache]: Analyzing trace with hash -459646902, now seen corresponding path program 1 times [2022-11-02 20:43:19,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:19,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168952055] [2022-11-02 20:43:19,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:19,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:19,963 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:19,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:19,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168952055] [2022-11-02 20:43:19,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168952055] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:19,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849948078] [2022-11-02 20:43:19,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:19,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:19,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:19,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:19,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:43:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:20,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:43:20,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:20,235 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:20,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:20,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849948078] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:20,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:43:20,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2022-11-02 20:43:20,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143102645] [2022-11-02 20:43:20,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:20,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:43:20,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:20,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:43:20,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:43:20,338 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-02 20:43:20,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:20,376 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-11-02 20:43:20,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:43:20,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-02 20:43:20,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:20,381 INFO L225 Difference]: With dead ends: 72 [2022-11-02 20:43:20,381 INFO L226 Difference]: Without dead ends: 52 [2022-11-02 20:43:20,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:43:20,384 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 29 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:20,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 66 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:20,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-02 20:43:20,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-11-02 20:43:20,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 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-02 20:43:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2022-11-02 20:43:20,399 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 32 [2022-11-02 20:43:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:20,399 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2022-11-02 20:43:20,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-02 20:43:20,399 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2022-11-02 20:43:20,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:43:20,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:20,400 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:20,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:20,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:20,627 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:20,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:20,627 INFO L85 PathProgramCache]: Analyzing trace with hash -910589295, now seen corresponding path program 2 times [2022-11-02 20:43:20,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:20,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652238956] [2022-11-02 20:43:20,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:20,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 20:43:21,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:21,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652238956] [2022-11-02 20:43:21,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652238956] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:21,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984624563] [2022-11-02 20:43:21,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:43:21,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:21,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:21,413 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:21,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:43:21,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:43:21,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:43:21,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-02 20:43:21,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:21,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:43:21,724 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:43:21,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:43:21,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:21,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:21,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:21,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:21,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2022-11-02 20:43:21,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-02 20:43:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 20:43:21,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:22,027 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_694 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_694) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2022-11-02 20:43:22,066 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:22,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 59 [2022-11-02 20:43:22,075 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:22,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 26 [2022-11-02 20:43:22,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:43:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2022-11-02 20:43:22,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984624563] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:22,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:43:22,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2022-11-02 20:43:22,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542798004] [2022-11-02 20:43:22,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:22,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-02 20:43:22,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:22,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 20:43:22,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=294, Unknown=1, NotChecked=34, Total=380 [2022-11-02 20:43:22,133 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 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-02 20:43:23,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:23,125 INFO L93 Difference]: Finished difference Result 128 states and 170 transitions. [2022-11-02 20:43:23,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:43:23,125 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 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-02 20:43:23,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:23,126 INFO L225 Difference]: With dead ends: 128 [2022-11-02 20:43:23,127 INFO L226 Difference]: Without dead ends: 115 [2022-11-02 20:43:23,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=267, Invalid=926, Unknown=1, NotChecked=66, Total=1260 [2022-11-02 20:43:23,128 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 559 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:23,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 117 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 201 Invalid, 0 Unknown, 83 Unchecked, 0.5s Time] [2022-11-02 20:43:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-02 20:43:23,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 46. [2022-11-02 20:43:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 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-02 20:43:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-11-02 20:43:23,152 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 37 [2022-11-02 20:43:23,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:23,153 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-11-02 20:43:23,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 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-02 20:43:23,153 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-11-02 20:43:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:43:23,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:23,154 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:23,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:23,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-02 20:43:23,372 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:23,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:23,372 INFO L85 PathProgramCache]: Analyzing trace with hash -908742253, now seen corresponding path program 1 times [2022-11-02 20:43:23,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:23,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076081888] [2022-11-02 20:43:23,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:23,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:24,369 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 28 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:43:24,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:24,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076081888] [2022-11-02 20:43:24,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076081888] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:24,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815262827] [2022-11-02 20:43:24,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:24,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:24,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:24,375 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:24,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:43:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:24,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-02 20:43:24,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:24,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:43:24,651 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:43:24,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:43:24,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2022-11-02 20:43:24,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:43:24,859 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 20:43:24,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:24,893 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) is different from false [2022-11-02 20:43:24,933 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:24,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 61 [2022-11-02 20:43:24,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-11-02 20:43:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2022-11-02 20:43:24,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815262827] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:24,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:43:24,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 22 [2022-11-02 20:43:24,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593009622] [2022-11-02 20:43:24,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:25,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-02 20:43:25,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:25,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-02 20:43:25,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=365, Unknown=1, NotChecked=38, Total=462 [2022-11-02 20:43:25,003 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 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-02 20:43:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:25,761 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2022-11-02 20:43:25,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:43:25,762 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 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-02 20:43:25,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:25,763 INFO L225 Difference]: With dead ends: 76 [2022-11-02 20:43:25,763 INFO L226 Difference]: Without dead ends: 63 [2022-11-02 20:43:25,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=726, Unknown=1, NotChecked=58, Total=992 [2022-11-02 20:43:25,765 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 210 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:25,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 115 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 230 Invalid, 0 Unknown, 60 Unchecked, 0.5s Time] [2022-11-02 20:43:25,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-02 20:43:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 48. [2022-11-02 20:43:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 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-02 20:43:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-11-02 20:43:25,775 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 37 [2022-11-02 20:43:25,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:25,776 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-11-02 20:43:25,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 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-02 20:43:25,776 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-11-02 20:43:25,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:43:25,777 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:25,777 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:25,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:25,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:25,992 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:25,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:25,992 INFO L85 PathProgramCache]: Analyzing trace with hash -908740331, now seen corresponding path program 1 times [2022-11-02 20:43:25,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:25,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076509146] [2022-11-02 20:43:25,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:25,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 28 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:43:26,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:26,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076509146] [2022-11-02 20:43:26,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076509146] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:26,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330127110] [2022-11-02 20:43:26,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:26,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:26,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:26,811 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:26,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:43:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:27,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-02 20:43:27,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:27,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:43:27,105 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:43:27,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:43:27,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2022-11-02 20:43:27,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:43:27,270 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 20:43:27,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:27,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1348 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1348) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) is different from false [2022-11-02 20:43:27,316 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:27,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 61 [2022-11-02 20:43:27,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-11-02 20:43:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2022-11-02 20:43:27,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330127110] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:27,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:43:27,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 21 [2022-11-02 20:43:27,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273170841] [2022-11-02 20:43:27,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:27,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-02 20:43:27,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:27,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-02 20:43:27,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=327, Unknown=1, NotChecked=36, Total=420 [2022-11-02 20:43:27,378 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 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-02 20:43:28,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:28,062 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2022-11-02 20:43:28,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:43:28,062 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 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 37 [2022-11-02 20:43:28,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:28,063 INFO L225 Difference]: With dead ends: 65 [2022-11-02 20:43:28,063 INFO L226 Difference]: Without dead ends: 63 [2022-11-02 20:43:28,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=634, Unknown=1, NotChecked=54, Total=870 [2022-11-02 20:43:28,065 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 266 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:28,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 98 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 156 Invalid, 0 Unknown, 57 Unchecked, 0.4s Time] [2022-11-02 20:43:28,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-02 20:43:28,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2022-11-02 20:43:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 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-02 20:43:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2022-11-02 20:43:28,075 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 37 [2022-11-02 20:43:28,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:28,075 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2022-11-02 20:43:28,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 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-02 20:43:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-11-02 20:43:28,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:43:28,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:28,077 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:28,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:28,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:28,302 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:28,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:28,303 INFO L85 PathProgramCache]: Analyzing trace with hash 829738032, now seen corresponding path program 1 times [2022-11-02 20:43:28,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:28,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367990579] [2022-11-02 20:43:28,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:28,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 20:43:28,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:28,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367990579] [2022-11-02 20:43:28,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367990579] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:28,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634606626] [2022-11-02 20:43:28,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:28,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:28,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:28,763 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:28,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:43:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:29,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-02 20:43:29,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:29,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:43:29,108 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:43:29,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:43:29,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-02 20:43:29,197 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:43:29,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-02 20:43:29,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-02 20:43:29,344 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 20:43:29,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:29,451 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1671 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0))) is different from false [2022-11-02 20:43:29,466 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:29,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-11-02 20:43:29,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2022-11-02 20:43:29,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-02 20:43:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2022-11-02 20:43:29,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634606626] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:29,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:43:29,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-11-02 20:43:29,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712707040] [2022-11-02 20:43:29,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:29,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-02 20:43:29,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:29,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-02 20:43:29,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=634, Unknown=1, NotChecked=50, Total=756 [2022-11-02 20:43:29,653 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 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-02 20:43:30,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:30,876 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2022-11-02 20:43:30,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:43:30,876 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 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 38 [2022-11-02 20:43:30,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:30,877 INFO L225 Difference]: With dead ends: 94 [2022-11-02 20:43:30,877 INFO L226 Difference]: Without dead ends: 56 [2022-11-02 20:43:30,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=271, Invalid=1214, Unknown=1, NotChecked=74, Total=1560 [2022-11-02 20:43:30,879 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 314 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:30,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 124 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 266 Invalid, 0 Unknown, 51 Unchecked, 0.7s Time] [2022-11-02 20:43:30,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-02 20:43:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2022-11-02 20:43:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 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-02 20:43:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-11-02 20:43:30,890 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 38 [2022-11-02 20:43:30,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:30,891 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-11-02 20:43:30,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 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-02 20:43:30,891 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-11-02 20:43:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:43:30,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:30,892 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:30,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:31,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:31,108 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:31,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:31,108 INFO L85 PathProgramCache]: Analyzing trace with hash 731872996, now seen corresponding path program 1 times [2022-11-02 20:43:31,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:31,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021904920] [2022-11-02 20:43:31,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:31,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 37 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:43:32,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:32,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021904920] [2022-11-02 20:43:32,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021904920] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:32,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299360134] [2022-11-02 20:43:32,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:32,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:32,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:32,585 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:32,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:43:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:32,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-02 20:43:32,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:32,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:43:32,941 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:43:32,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:43:33,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:33,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:33,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:33,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:33,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2022-11-02 20:43:33,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:43:33,216 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:43:33,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:43:33,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:43:33,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-02 20:43:33,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-02 20:43:33,353 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:43:33,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 74 [2022-11-02 20:43:33,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:33,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2022-11-02 20:43:33,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:43:33,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-02 20:43:33,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:43:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:43:33,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:33,831 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2013 Int) (v_ArrVal_2012 (Array Int Int)) (v_ArrVal_2010 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2013)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2010) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2012) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) 0)) is different from false [2022-11-02 20:43:33,849 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:33,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 77 [2022-11-02 20:43:33,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 112 [2022-11-02 20:43:33,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2022-11-02 20:43:33,873 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:33,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 86 [2022-11-02 20:43:33,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 118 [2022-11-02 20:43:33,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 101 [2022-11-02 20:43:34,030 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12)) (.cse6 (not .cse7))) (and (or (and (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 v_ArrVal_2013))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) v_arrayElimCell_34) v_arrayElimCell_36) 0) (= (select .cse1 v_arrayElimCell_36) 0))))) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 v_ArrVal_2013))) (let ((.cse3 (select (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse4) v_arrayElimCell_34))) (or (= (select .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0) (= (select .cse3 v_arrayElimCell_36) 0) (= (select .cse4 v_arrayElimCell_36) 0))))))) .cse6) (or .cse7 (forall ((v_ArrVal_2007 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0))) (forall ((v_ArrVal_2007 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (let ((.cse8 (select .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (= (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0) (forall ((v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (let ((.cse10 (store .cse8 .cse2 v_ArrVal_2013))) (let ((.cse9 (select (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse10) v_arrayElimCell_34))) (or (= (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0) (= (select .cse9 v_arrayElimCell_36) 0) (= (select .cse10 v_arrayElimCell_36) 0))))))))) (forall ((v_ArrVal_2007 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (= (select .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0) (forall ((v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (let ((.cse14 (store .cse12 .cse2 v_ArrVal_2013))) (or (= (select (select (store .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse14) v_arrayElimCell_34) v_arrayElimCell_36) 0) (= (select .cse14 v_arrayElimCell_36) 0)))))))) (or (and (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (= (select (select (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 v_ArrVal_2013))) v_arrayElimCell_34) v_arrayElimCell_36) 0)) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (let ((.cse16 (select (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (store .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 v_ArrVal_2013))) v_arrayElimCell_34))) (or (= (select .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0) (= (select .cse16 v_arrayElimCell_36) 0))))) .cse6)))) is different from false [2022-11-02 20:43:34,232 INFO L356 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-11-02 20:43:34,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 61 [2022-11-02 20:43:34,298 INFO L356 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-11-02 20:43:34,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 51 [2022-11-02 20:43:34,358 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:34,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-11-02 20:43:34,366 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:34,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:43:34,966 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:34,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 258 treesize of output 138 [2022-11-02 20:43:34,975 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:43:34,993 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:34,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2807 treesize of output 2641 [2022-11-02 20:43:35,070 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:35,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 621 treesize of output 585 [2022-11-02 20:43:35,096 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:35,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 555 treesize of output 547 [2022-11-02 20:43:35,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-02 20:43:35,452 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:35,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 362 treesize of output 362 [2022-11-02 20:43:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 41 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 6 not checked. [2022-11-02 20:43:35,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299360134] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:35,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:43:35,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 42 [2022-11-02 20:43:35,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008045705] [2022-11-02 20:43:35,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:35,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-02 20:43:35,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:35,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-02 20:43:35,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1404, Unknown=6, NotChecked=154, Total=1722 [2022-11-02 20:43:35,757 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 42 states have internal predecessors, (89), 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-02 20:43:37,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:37,451 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2022-11-02 20:43:37,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:43:37,452 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 42 states have internal predecessors, (89), 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 43 [2022-11-02 20:43:37,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:37,453 INFO L225 Difference]: With dead ends: 75 [2022-11-02 20:43:37,453 INFO L226 Difference]: Without dead ends: 62 [2022-11-02 20:43:37,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=337, Invalid=2421, Unknown=6, NotChecked=206, Total=2970 [2022-11-02 20:43:37,457 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 154 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 255 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:37,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 206 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 290 Invalid, 0 Unknown, 255 Unchecked, 0.8s Time] [2022-11-02 20:43:37,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-02 20:43:37,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2022-11-02 20:43:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 51 states have internal predecessors, (60), 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-02 20:43:37,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-11-02 20:43:37,479 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 43 [2022-11-02 20:43:37,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:37,479 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-11-02 20:43:37,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 42 states have internal predecessors, (89), 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-02 20:43:37,480 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-11-02 20:43:37,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:43:37,485 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:37,486 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:37,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-02 20:43:37,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:43:37,699 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:37,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:37,699 INFO L85 PathProgramCache]: Analyzing trace with hash 733720038, now seen corresponding path program 1 times [2022-11-02 20:43:37,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:37,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048983706] [2022-11-02 20:43:37,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:37,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,328 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 35 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:43:39,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:39,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048983706] [2022-11-02 20:43:39,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048983706] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:39,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385011121] [2022-11-02 20:43:39,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:39,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:39,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:39,330 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:39,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:43:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-02 20:43:39,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:39,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:43:39,677 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:43:39,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:43:39,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:39,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:39,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:39,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:39,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2022-11-02 20:43:39,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:43:39,905 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:43:39,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:43:39,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:43:39,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-02 20:43:39,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-02 20:43:40,039 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:43:40,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 81 [2022-11-02 20:43:40,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:40,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2022-11-02 20:43:40,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-11-02 20:43:40,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 22 [2022-11-02 20:43:40,479 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:40,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2022-11-02 20:43:40,539 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 39 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:43:40,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:40,923 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2357 Int) (v_ArrVal_2353 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2353) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse0 .cse1 v_ArrVal_2357)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) (+ 8 .cse3)) 0) (= .cse3 0)))) (forall ((v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2357 Int) (v_ArrVal_2353 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (or (= .cse4 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse0 .cse1 v_ArrVal_2357)) .cse4) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2353) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) 0)))))) is different from false [2022-11-02 20:43:40,947 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:40,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 79 [2022-11-02 20:43:40,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 120 [2022-11-02 20:43:40,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2022-11-02 20:43:40,978 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:40,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 102 [2022-11-02 20:43:40,988 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:40,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 149 [2022-11-02 20:43:40,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 116 [2022-11-02 20:43:41,316 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:41,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 91 [2022-11-02 20:43:41,324 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:41,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 139 [2022-11-02 20:43:41,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2022-11-02 20:43:41,343 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:41,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 90 [2022-11-02 20:43:41,352 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:41,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 130 [2022-11-02 20:43:41,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 109 [2022-11-02 20:43:44,275 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:44,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:43:44,298 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:44,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:43:44,324 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:44,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:43:44,338 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse1 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0)))) (and (or (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((v_ArrVal_2345 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0)) (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| v_ArrVal_2345) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0) 0)))) (or .cse1 (forall ((v_arrayElimCell_73 Int) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimCell_70 Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_17) v_arrayElimCell_70) (+ 8 v_arrayElimCell_73)) 0) (= v_arrayElimCell_70 0)))) (or .cse1 (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_64 Int) (v_arrayElimCell_67 Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_16) v_arrayElimCell_64) (+ 8 v_arrayElimCell_67))) (= v_arrayElimCell_67 0)))) (or (and (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0)) (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_2345 (Array Int Int))) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| v_ArrVal_2345) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0) 0)))) (or .cse1 (forall ((v_arrayElimCell_73 Int) (v_arrayElimCell_70 Int) (v_arrayElimArr_18 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_18) v_arrayElimCell_70) (+ 8 v_arrayElimCell_73)) 0) (= v_arrayElimCell_70 0))))) (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2022-11-02 20:43:44,405 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse1 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) (and (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (forall ((v_ArrVal_2345 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0)) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| v_ArrVal_2345) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 0) (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (or (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_64 Int) (v_arrayElimCell_67 Int)) (or (= v_arrayElimCell_67 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_16) v_arrayElimCell_64) (+ 8 v_arrayElimCell_67)) 0))) .cse1) (or (forall ((v_arrayElimCell_73 Int) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimCell_70 Int)) (or (= v_arrayElimCell_70 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_17) v_arrayElimCell_70) (+ 8 v_arrayElimCell_73)) 0))) .cse1) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (and (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0)) (forall ((v_ArrVal_2345 (Array Int Int))) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| v_ArrVal_2345) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 0)) (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (forall ((v_arrayElimCell_73 Int) (v_arrayElimCell_70 Int) (v_arrayElimArr_18 (Array Int Int))) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_18) v_arrayElimCell_70) (+ 8 v_arrayElimCell_73))) (= v_arrayElimCell_70 0))) .cse1))))) is different from false [2022-11-02 20:43:44,689 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:44,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 64 [2022-11-02 20:43:44,694 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:43:44,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-11-02 20:43:44,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-02 20:43:44,724 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:44,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 64 [2022-11-02 20:43:44,737 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:44,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 69 [2022-11-02 20:43:44,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-02 20:43:44,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-11-02 20:43:44,788 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:44,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 64 [2022-11-02 20:43:44,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:43:44,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:43:44,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-11-02 20:43:44,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:43:44,824 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:44,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 64 [2022-11-02 20:43:44,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:43:44,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-11-02 20:43:44,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-02 20:43:45,206 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 36 proven. 11 refuted. 1 times theorem prover too weak. 7 trivial. 6 not checked. [2022-11-02 20:43:45,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385011121] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:45,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:43:45,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 47 [2022-11-02 20:43:45,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664200325] [2022-11-02 20:43:45,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:45,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-02 20:43:45,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:45,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-02 20:43:45,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1722, Unknown=5, NotChecked=258, Total=2162 [2022-11-02 20:43:45,209 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 47 states have internal predecessors, (93), 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-02 20:43:48,549 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse2 (not (= .cse3 0)))) (and .cse0 (or .cse0 (forall ((v_ArrVal_2345 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0)) (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| v_ArrVal_2345) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1) 0)))) (or .cse2 (forall ((v_arrayElimCell_73 Int) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimCell_70 Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_17) v_arrayElimCell_70) (+ 8 v_arrayElimCell_73)) 0) (= v_arrayElimCell_70 0)))) (or .cse2 (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_64 Int) (v_arrayElimCell_67 Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_16) v_arrayElimCell_64) (+ 8 v_arrayElimCell_67))) (= v_arrayElimCell_67 0)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 8) 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_27| Int)) (and (not (= |v_ULTIMATE.start_dll_create_~head~0#1.base_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~head~0#1.base_27|) 1))) (= .cse3 1) (or (and (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0)) (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_2345 (Array Int Int))) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| v_ArrVal_2345) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1) 0)))) (or .cse2 (forall ((v_arrayElimCell_73 Int) (v_arrayElimCell_70 Int) (v_arrayElimArr_18 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_18) v_arrayElimCell_70) (+ 8 v_arrayElimCell_73)) 0) (= v_arrayElimCell_70 0))))) (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2022-11-02 20:43:49,020 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse3 (select .cse4 .cse8)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse2 (not (= .cse7 0))) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and .cse0 (or .cse0 (forall ((v_ArrVal_2345 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0)) (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| v_ArrVal_2345) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1) 0)))) (or .cse2 (forall ((v_arrayElimCell_73 Int) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimCell_70 Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_17) v_arrayElimCell_70) (+ 8 v_arrayElimCell_73)) 0) (= v_arrayElimCell_70 0)))) (not (= .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (select |c_#memory_int| (select .cse4 4)) 8) 0) (or .cse2 (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_64 Int) (v_arrayElimCell_67 Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_16) v_arrayElimCell_64) (+ 8 v_arrayElimCell_67))) (= v_arrayElimCell_67 0)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 8) 0) (= 0 (select .cse4 .cse5)) (= (select .cse6 4) 0) (= (select (select |c_#memory_int| .cse3) 8) 0) (= (select .cse6 .cse5) 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_27| Int)) (and (not (= |v_ULTIMATE.start_dll_create_~head~0#1.base_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~head~0#1.base_27|) 1))) (= .cse7 1) (or (and (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0)) (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_2345 (Array Int Int))) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| v_ArrVal_2345) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1) 0)))) (or .cse2 (forall ((v_arrayElimCell_73 Int) (v_arrayElimCell_70 Int) (v_arrayElimArr_18 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_18) v_arrayElimCell_70) (+ 8 v_arrayElimCell_73)) 0) (= v_arrayElimCell_70 0))))) (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse6 .cse8) 0)))) is different from false [2022-11-02 20:43:50,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:50,128 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-11-02 20:43:50,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:43:50,128 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 47 states have internal predecessors, (93), 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 43 [2022-11-02 20:43:50,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:50,129 INFO L225 Difference]: With dead ends: 75 [2022-11-02 20:43:50,129 INFO L226 Difference]: Without dead ends: 62 [2022-11-02 20:43:50,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=377, Invalid=2826, Unknown=9, NotChecked=570, Total=3782 [2022-11-02 20:43:50,132 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 216 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:50,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 221 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 375 Invalid, 0 Unknown, 264 Unchecked, 0.8s Time] [2022-11-02 20:43:50,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-02 20:43:50,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2022-11-02 20:43:50,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.169811320754717) internal successors, (62), 53 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-02 20:43:50,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-11-02 20:43:50,145 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 43 [2022-11-02 20:43:50,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:50,146 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-11-02 20:43:50,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 47 states have internal predecessors, (93), 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-02 20:43:50,146 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-11-02 20:43:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:43:50,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:50,147 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:50,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:50,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:50,363 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:50,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:50,363 INFO L85 PathProgramCache]: Analyzing trace with hash 733721960, now seen corresponding path program 1 times [2022-11-02 20:43:50,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:50,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995256092] [2022-11-02 20:43:50,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:50,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:43:51,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:51,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995256092] [2022-11-02 20:43:51,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995256092] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:51,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950353717] [2022-11-02 20:43:51,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:51,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:51,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:51,935 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:51,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:43:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:52,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-02 20:43:52,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:52,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:43:52,301 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:43:52,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:43:52,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:52,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:52,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:52,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:52,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2022-11-02 20:43:52,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:43:52,538 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:43:52,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:43:52,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:43:52,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-02 20:43:52,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-02 20:43:52,651 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:43:52,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 74 [2022-11-02 20:43:52,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:52,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2022-11-02 20:43:52,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:43:52,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:43:52,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-02 20:43:52,926 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 38 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:43:52,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:53,112 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2694 Int) (v_ArrVal_2697 (Array Int Int)) (v_ArrVal_2695 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2694)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2695) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (+ 16 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2697) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)))) 0)) is different from false [2022-11-02 20:43:53,130 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:53,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 79 [2022-11-02 20:43:53,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 116 [2022-11-02 20:43:53,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2022-11-02 20:43:53,163 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:53,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 90 [2022-11-02 20:43:53,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 126 [2022-11-02 20:43:53,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 109 [2022-11-02 20:43:53,354 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse11 (not .cse0)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 16)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (and (or .cse0 (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (= (select .cse1 .cse2) 0) (= (select (select (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse1 .cse4 v_ArrVal_2694)) v_arrayElimCell_98) (+ 16 v_arrayElimCell_100)) 0)))))) (or .cse0 (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse6 (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse5 .cse4 v_ArrVal_2694)) v_arrayElimCell_98))) (or (= (select .cse5 .cse2) 0) (= (select .cse6 .cse2) 0) (= (select .cse6 (+ 16 v_arrayElimCell_100)) 0))))))) (or (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (let ((.cse8 (store (select .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4 v_ArrVal_2694)) (.cse9 (+ 16 v_arrayElimCell_100))) (or (= (select .cse8 .cse9) 0) (= (select (select (store .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse8) v_arrayElimCell_98) .cse9) 0))))) .cse11) (or (forall ((v_ArrVal_2688 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2) 0)) .cse0) (or (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (let ((.cse12 (select (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (store .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4 v_ArrVal_2694))) v_arrayElimCell_98))) (or (= (select .cse12 .cse2) 0) (= (select .cse12 (+ 16 v_arrayElimCell_100)) 0)))) .cse11) (or (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (= (select (select (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4 v_ArrVal_2694))) v_arrayElimCell_98) (+ 16 v_arrayElimCell_100)) 0)) .cse11) (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (let ((.cse15 (select .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse16 (store .cse15 .cse4 v_ArrVal_2694)) (.cse17 (+ 16 v_arrayElimCell_100))) (or (= (select .cse15 .cse2) 0) (= (select .cse16 .cse17) 0) (= (select (select (store .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse16) v_arrayElimCell_98) .cse17) 0)))))) (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (let ((.cse19 (select .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse21 (store .cse19 .cse4 v_ArrVal_2694))) (let ((.cse20 (select (store .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse21) v_arrayElimCell_98)) (.cse22 (+ 16 v_arrayElimCell_100))) (or (= (select .cse19 .cse2) 0) (= (select .cse20 .cse2) 0) (= (select .cse21 .cse22) 0) (= (select .cse20 .cse22) 0))))))) (or .cse11 (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (let ((.cse25 (store (select .cse27 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4 v_ArrVal_2694))) (let ((.cse24 (select (store .cse27 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse25) v_arrayElimCell_98)) (.cse26 (+ 16 v_arrayElimCell_100))) (or (= (select .cse24 .cse2) 0) (= (select .cse25 .cse26) 0) (= (select .cse24 .cse26) 0)))))))))) is different from false [2022-11-02 20:43:53,571 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:53,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2022-11-02 20:43:53,582 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:53,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:43:53,608 INFO L356 Elim1Store]: treesize reduction 14, result has 63.2 percent of original size [2022-11-02 20:43:53,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 67 [2022-11-02 20:43:53,743 INFO L356 Elim1Store]: treesize reduction 14, result has 63.2 percent of original size [2022-11-02 20:43:53,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 55 [2022-11-02 20:43:54,426 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:54,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 179 treesize of output 115 [2022-11-02 20:43:54,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:43:54,446 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:54,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 708 treesize of output 686 [2022-11-02 20:43:54,478 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:54,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 428 treesize of output 388 [2022-11-02 20:43:54,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 342 [2022-11-02 20:43:54,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-02 20:43:54,544 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:54,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 184 [2022-11-02 20:43:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 38 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 6 not checked. [2022-11-02 20:43:54,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950353717] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:54,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:43:54,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 41 [2022-11-02 20:43:54,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92511415] [2022-11-02 20:43:54,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:54,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-02 20:43:54,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:54,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-02 20:43:54,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1330, Unknown=6, NotChecked=150, Total=1640 [2022-11-02 20:43:54,876 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 41 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 41 states have internal predecessors, (92), 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-02 20:43:56,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:56,795 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-11-02 20:43:56,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:43:56,795 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 41 states have internal predecessors, (92), 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 43 [2022-11-02 20:43:56,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:56,796 INFO L225 Difference]: With dead ends: 64 [2022-11-02 20:43:56,796 INFO L226 Difference]: Without dead ends: 62 [2022-11-02 20:43:56,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=339, Invalid=2314, Unknown=7, NotChecked=202, Total=2862 [2022-11-02 20:43:56,798 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 140 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 295 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:56,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 250 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 395 Invalid, 0 Unknown, 295 Unchecked, 0.7s Time] [2022-11-02 20:43:56,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-02 20:43:56,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2022-11-02 20:43:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 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-02 20:43:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-11-02 20:43:56,810 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 43 [2022-11-02 20:43:56,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:56,810 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-11-02 20:43:56,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 41 states have internal predecessors, (92), 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-02 20:43:56,811 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-11-02 20:43:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:43:56,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:56,811 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:56,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:57,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:43:57,015 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:57,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:57,015 INFO L85 PathProgramCache]: Analyzing trace with hash 206461501, now seen corresponding path program 1 times [2022-11-02 20:43:57,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:57,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121987826] [2022-11-02 20:43:57,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:57,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:43:58,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:58,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121987826] [2022-11-02 20:43:58,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121987826] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:58,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34194413] [2022-11-02 20:43:58,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:58,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:58,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:58,281 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:58,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:43:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:58,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-02 20:43:58,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:58,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:43:58,619 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:43:58,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:43:58,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:58,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:58,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:58,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:58,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2022-11-02 20:43:58,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:43:58,840 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:43:58,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:43:58,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-02 20:43:58,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-02 20:43:58,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:43:58,968 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:43:58,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 81 [2022-11-02 20:43:58,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:58,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2022-11-02 20:43:58,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-11-02 20:43:59,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2022-11-02 20:43:59,264 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:59,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2022-11-02 20:43:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:43:59,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:59,624 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_3040 Int) (v_ArrVal_3036 (Array Int Int)) (v_ArrVal_3038 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3036) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse0 .cse1 v_ArrVal_3040)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3038) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) .cse3) 0) (= .cse3 0)))) (forall ((v_ArrVal_3040 Int) (v_ArrVal_3036 (Array Int Int)) (v_ArrVal_3038 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3038) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (or (= .cse4 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse0 .cse1 v_ArrVal_3040)) .cse4) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3036) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) 0)))))) is different from false [2022-11-02 20:43:59,643 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:59,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 77 [2022-11-02 20:43:59,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 116 [2022-11-02 20:43:59,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2022-11-02 20:43:59,676 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:59,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 98 [2022-11-02 20:43:59,684 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:59,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 141 [2022-11-02 20:43:59,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 108 [2022-11-02 20:44:00,018 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:00,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 89 [2022-11-02 20:44:00,026 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:00,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 135 [2022-11-02 20:44:00,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2022-11-02 20:44:00,076 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:00,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 86 [2022-11-02 20:44:00,084 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:00,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 122 [2022-11-02 20:44:00,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 101 [2022-11-02 20:44:04,552 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:04,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-11-02 20:44:04,584 INFO L356 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2022-11-02 20:44:04,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 60 [2022-11-02 20:44:04,716 INFO L356 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-11-02 20:44:04,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 51 [2022-11-02 20:44:04,834 INFO L356 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-11-02 20:44:04,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 51 [2022-11-02 20:44:04,911 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:04,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2022-11-02 20:44:05,708 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:05,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 173 treesize of output 109 [2022-11-02 20:44:05,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:44:05,727 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:05,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 634 treesize of output 612 [2022-11-02 20:44:05,761 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:05,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 392 treesize of output 376 [2022-11-02 20:44:05,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 346 treesize of output 338 [2022-11-02 20:44:05,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-02 20:44:05,821 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:05,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 184 [2022-11-02 20:44:06,139 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:06,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 212 treesize of output 120 [2022-11-02 20:44:06,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:44:06,161 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:06,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4792 treesize of output 4692 [2022-11-02 20:44:06,338 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:06,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4912 treesize of output 4598 [2022-11-02 20:44:06,401 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:06,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4587 treesize of output 4467 [2022-11-02 20:44:06,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-02 20:44:37,520 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:37,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1728 treesize of output 1698 [2022-11-02 20:44:38,827 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 2 not checked. [2022-11-02 20:44:38,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34194413] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:44:38,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:44:38,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 43 [2022-11-02 20:44:38,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025340832] [2022-11-02 20:44:38,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:44:38,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-02 20:44:38,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:38,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-02 20:44:38,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1558, Unknown=4, NotChecked=80, Total=1806 [2022-11-02 20:44:38,830 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 43 states, 43 states have (on average 2.186046511627907) internal successors, (94), 43 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-02 20:44:40,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:40,260 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-11-02 20:44:40,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:44:40,261 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.186046511627907) internal successors, (94), 43 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) Word has length 44 [2022-11-02 20:44:40,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:40,261 INFO L225 Difference]: With dead ends: 69 [2022-11-02 20:44:40,262 INFO L226 Difference]: Without dead ends: 62 [2022-11-02 20:44:40,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=304, Invalid=2452, Unknown=4, NotChecked=102, Total=2862 [2022-11-02 20:44:40,263 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 147 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:40,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 202 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 314 Invalid, 0 Unknown, 156 Unchecked, 0.6s Time] [2022-11-02 20:44:40,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-02 20:44:40,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2022-11-02 20:44:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 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-02 20:44:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2022-11-02 20:44:40,278 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 44 [2022-11-02 20:44:40,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:40,278 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2022-11-02 20:44:40,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.186046511627907) internal successors, (94), 43 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-02 20:44:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-11-02 20:44:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:44:40,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:40,279 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:40,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:40,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 20:44:40,483 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:40,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:40,483 INFO L85 PathProgramCache]: Analyzing trace with hash 208308543, now seen corresponding path program 1 times [2022-11-02 20:44:40,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:40,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865650592] [2022-11-02 20:44:40,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:40,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:41,989 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:44:41,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:41,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865650592] [2022-11-02 20:44:41,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865650592] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:41,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007288613] [2022-11-02 20:44:41,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:41,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:41,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:41,991 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:41,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:44:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:42,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-02 20:44:42,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:42,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:44:42,412 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:44:42,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:44:42,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-02 20:44:42,534 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:44:42,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-02 20:44:42,643 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-02 20:44:42,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 20:44:42,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-02 20:44:42,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2022-11-02 20:44:42,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:44:42,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:44:42,789 INFO L356 Elim1Store]: treesize reduction 55, result has 14.1 percent of original size [2022-11-02 20:44:42,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 57 [2022-11-02 20:44:42,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:44:43,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:44:43,126 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:44:43,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 23 [2022-11-02 20:44:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 33 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:44:43,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:43,352 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3375 (Array Int Int)) (v_ArrVal_3376 Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3376)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3375) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) 4))) 0))) is different from false [2022-11-02 20:44:43,369 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:43,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 89 [2022-11-02 20:44:43,380 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:43,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 78 [2022-11-02 20:44:43,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 115 [2022-11-02 20:44:43,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 106 [2022-11-02 20:44:43,588 INFO L356 Elim1Store]: treesize reduction 14, result has 63.2 percent of original size [2022-11-02 20:44:43,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 68 [2022-11-02 20:44:43,618 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:43,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-11-02 20:44:43,916 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:43,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 81 [2022-11-02 20:44:43,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:44:43,942 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:43,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3473 treesize of output 3119 [2022-11-02 20:44:43,994 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:43,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3119 treesize of output 1987 [2022-11-02 20:44:44,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 214 [2022-11-02 20:44:44,345 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 2 not checked. [2022-11-02 20:44:44,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007288613] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:44:44,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:44:44,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 46 [2022-11-02 20:44:44,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511135374] [2022-11-02 20:44:44,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:44:44,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-02 20:44:44,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:44,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-02 20:44:44,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1831, Unknown=12, NotChecked=86, Total=2070 [2022-11-02 20:44:44,348 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 46 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 46 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-02 20:44:48,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:48,209 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-11-02 20:44:48,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:44:48,210 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 46 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) Word has length 44 [2022-11-02 20:44:48,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:48,210 INFO L225 Difference]: With dead ends: 64 [2022-11-02 20:44:48,210 INFO L226 Difference]: Without dead ends: 55 [2022-11-02 20:44:48,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=585, Invalid=3439, Unknown=12, NotChecked=124, Total=4160 [2022-11-02 20:44:48,212 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 97 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:48,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 522 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 672 Invalid, 0 Unknown, 201 Unchecked, 1.4s Time] [2022-11-02 20:44:48,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-02 20:44:48,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-02 20:44:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 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-02 20:44:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-11-02 20:44:48,228 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 44 [2022-11-02 20:44:48,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:48,228 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-11-02 20:44:48,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 46 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-02 20:44:48,229 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-11-02 20:44:48,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-02 20:44:48,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:48,229 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:48,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:48,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 20:44:48,443 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:48,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:48,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1765953289, now seen corresponding path program 2 times [2022-11-02 20:44:48,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:48,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991677466] [2022-11-02 20:44:48,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:48,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:51,074 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 38 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:44:51,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:51,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991677466] [2022-11-02 20:44:51,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991677466] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:51,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809353534] [2022-11-02 20:44:51,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:44:51,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:51,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:51,082 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:51,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e05b97fb-2abe-4ac0-ae9e-45be1e89d8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:44:51,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:44:51,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:44:51,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 107 conjunts are in the unsatisfiable core [2022-11-02 20:44:51,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:51,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:44:51,533 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:44:51,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:44:51,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:44:51,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:44:51,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:44:51,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:44:51,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2022-11-02 20:44:51,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-02 20:44:51,823 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-02 20:44:51,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-02 20:44:51,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-02 20:44:51,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-02 20:44:51,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-02 20:44:52,095 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:44:52,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 94 [2022-11-02 20:44:52,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:44:52,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-11-02 20:44:52,309 INFO L356 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2022-11-02 20:44:52,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2022-11-02 20:44:52,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2022-11-02 20:44:52,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:44:52,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2022-11-02 20:44:52,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-11-02 20:44:52,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2022-11-02 20:44:52,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:44:52,537 INFO L356 Elim1Store]: treesize reduction 55, result has 14.1 percent of original size [2022-11-02 20:44:52,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 166 treesize of output 93 [2022-11-02 20:44:52,551 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-02 20:44:52,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 62 [2022-11-02 20:44:52,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2022-11-02 20:44:53,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:44:53,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:44:53,311 INFO L356 Elim1Store]: treesize reduction 51, result has 5.6 percent of original size [2022-11-02 20:44:53,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 155 treesize of output 61 [2022-11-02 20:44:53,328 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:44:53,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 18 [2022-11-02 20:44:53,389 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:44:53,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:53,714 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3738 Int) (v_ArrVal_3735 (Array Int Int))) (= (let ((.cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 v_ArrVal_3738))) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3735) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))) 0)) is different from false [2022-11-02 20:44:53,734 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:53,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 265 treesize of output 222 [2022-11-02 20:44:53,753 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:53,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 205 treesize of output 162 [2022-11-02 20:44:53,774 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_ArrVal_3738 Int) (v_arrayElimArr_48 (Array Int Int)) (v_arrayElimArr_49 (Array Int Int)) (v_ArrVal_3730 (Array Int Int)) (v_ArrVal_3735 (Array Int Int))) (let ((.cse0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (or (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_48 .cse0))) (= (let ((.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (let ((.cse4 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_48))) (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_3738)))) (.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_49))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3730) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3735) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) 0) (not (= (select v_arrayElimArr_49 .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2022-11-02 20:44:54,203 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3717 (Array Int Int)) (v_ArrVal_3715 Int) (v_ArrVal_3738 Int) (v_ArrVal_3719 (Array Int Int)) (v_arrayElimArr_48 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.offset_39| Int) (v_arrayElimArr_49 (Array Int Int)) (v_ArrVal_3730 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_38| Int) (v_ArrVal_3735 (Array Int Int))) (let ((.cse5 (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_39| 4))) (let ((.cse0 (select v_arrayElimArr_49 .cse5)) (.cse9 (select v_arrayElimArr_48 .cse5))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38|) 0)) (= (let ((.cse7 (+ .cse9 12))) (let ((.cse4 (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3719) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38| v_arrayElimArr_48))) (store .cse8 .cse0 (store (select .cse8 .cse0) .cse7 v_ArrVal_3738)))) (.cse1 (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3717) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38| v_arrayElimArr_49))) (store .cse6 .cse0 (store (select .cse6 .cse0) .cse7 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38|))))) (let ((.cse2 (select (select .cse1 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38|) .cse5)) (.cse3 (+ (select (select .cse4 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38|) .cse5) 4))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3715)) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38| v_ArrVal_3730) .cse0 v_ArrVal_3735) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) 0) (not (= .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) is different from false [2022-11-02 20:44:54,234 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:54,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 453 treesize of output 384 [2022-11-02 20:44:54,253 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:54,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 363 treesize of output 294 [2022-11-02 20:44:54,294 INFO L356 Elim1Store]: treesize reduction 48, result has 7.7 percent of original size [2022-11-02 20:44:54,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 148984 treesize of output 145050 [2022-11-02 20:44:54,717 INFO L356 Elim1Store]: treesize reduction 46, result has 66.9 percent of original size [2022-11-02 20:44:54,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 case distinctions, treesize of input 8922168 treesize of output 8135459 [2022-11-02 20:46:47,282 WARN L234 SmtUtils]: Spent 1.88m on a formula simplification. DAG size of input: 2161 DAG size of output: 2155 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:46:54,133 WARN L234 SmtUtils]: Spent 6.84s on a formula simplification that was a NOOP. DAG size: 2152 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:46:55,053 INFO L356 Elim1Store]: treesize reduction 71, result has 71.9 percent of original size [2022-11-02 20:46:55,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9126447 treesize of output 7863644