./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R --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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:25:39,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:25:39,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:25:39,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:25:39,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:25:39,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:25:39,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:25:39,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:25:39,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:25:39,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:25:39,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:25:39,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:25:39,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:25:39,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:25:39,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:25:39,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:25:39,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:25:39,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:25:39,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:25:39,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:25:39,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:25:39,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:25:39,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:25:39,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:25:39,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:25:39,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:25:39,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:25:39,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:25:39,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:25:39,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:25:39,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:25:39,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:25:39,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:25:39,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:25:39,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:25:39,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:25:39,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:25:39,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:25:39,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:25:39,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:25:39,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:25:39,593 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 18:25:39,627 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:25:39,627 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:25:39,627 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:25:39,628 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:25:39,628 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:25:39,628 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:25:39,629 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:25:39,629 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:25:39,630 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:25:39,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:25:39,630 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:25:39,630 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:25:39,634 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:25:39,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:25:39,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:25:39,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:25:39,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:25:39,635 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:25:39,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:25:39,635 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:25:39,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:25:39,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:25:39,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:25:39,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:25:39,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:25:39,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:25:39,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:25:39,637 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:25:39,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:25:39,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:25:39,639 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:25:39,639 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:25:39,639 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:25:39,640 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:25:39,640 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2022-11-25 18:25:39,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:25:39,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:25:39,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:25:39,957 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:25:39,959 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:25:39,960 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-11-25 18:25:42,929 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:25:43,201 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:25:43,201 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-11-25 18:25:43,213 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/data/a6eb32b9f/fd8d332f374740f68bf050ddc70dd406/FLAG0320276d5 [2022-11-25 18:25:43,227 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/data/a6eb32b9f/fd8d332f374740f68bf050ddc70dd406 [2022-11-25 18:25:43,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:25:43,232 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:25:43,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:25:43,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:25:43,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:25:43,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:25:43" (1/1) ... [2022-11-25 18:25:43,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c44da85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:43, skipping insertion in model container [2022-11-25 18:25:43,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:25:43" (1/1) ... [2022-11-25 18:25:43,246 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:25:43,313 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:25:43,721 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-11-25 18:25:43,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:25:43,745 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:25:43,820 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-11-25 18:25:43,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:25:43,858 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:25:43,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:43 WrapperNode [2022-11-25 18:25:43,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:25:43,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:25:43,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:25:43,861 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:25:43,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:43" (1/1) ... [2022-11-25 18:25:43,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:43" (1/1) ... [2022-11-25 18:25:43,943 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2022-11-25 18:25:43,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:25:43,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:25:43,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:25:43,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:25:43,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:43" (1/1) ... [2022-11-25 18:25:43,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:43" (1/1) ... [2022-11-25 18:25:43,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:43" (1/1) ... [2022-11-25 18:25:43,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:43" (1/1) ... [2022-11-25 18:25:43,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:43" (1/1) ... [2022-11-25 18:25:43,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:43" (1/1) ... [2022-11-25 18:25:43,969 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:43" (1/1) ... [2022-11-25 18:25:43,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:43" (1/1) ... [2022-11-25 18:25:43,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:25:43,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:25:43,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:25:43,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:25:43,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:43" (1/1) ... [2022-11-25 18:25:43,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:25:44,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:25:44,027 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:25:44,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:25:44,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:25:44,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:25:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-25 18:25:44,066 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-25 18:25:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:25:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:25:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:25:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 18:25:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 18:25:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:25:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 18:25:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:25:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:25:44,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:25:44,186 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:25:44,189 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:25:44,473 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:25:44,479 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:25:44,484 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 18:25:44,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:25:44 BoogieIcfgContainer [2022-11-25 18:25:44,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:25:44,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:25:44,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:25:44,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:25:44,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:25:43" (1/3) ... [2022-11-25 18:25:44,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b49083c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:25:44, skipping insertion in model container [2022-11-25 18:25:44,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:25:43" (2/3) ... [2022-11-25 18:25:44,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b49083c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:25:44, skipping insertion in model container [2022-11-25 18:25:44,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:25:44" (3/3) ... [2022-11-25 18:25:44,510 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2022-11-25 18:25:44,534 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:25:44,534 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:25:44,603 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:25:44,609 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;@56875861, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:25:44,609 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:25:44,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:25:44,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 18:25:44,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:44,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:25:44,623 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:25:44,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:44,628 INFO L85 PathProgramCache]: Analyzing trace with hash -497301104, now seen corresponding path program 1 times [2022-11-25 18:25:44,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:44,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082582598] [2022-11-25 18:25:44,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:44,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:44,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 18:25:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:25:45,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:25:45,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082582598] [2022-11-25 18:25:45,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082582598] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:25:45,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:25:45,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:25:45,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806989735] [2022-11-25 18:25:45,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:25:45,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:25:45,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:25:45,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:25:45,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:25:45,063 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:25:45,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:25:45,153 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2022-11-25 18:25:45,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:25:45,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-11-25 18:25:45,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:25:45,164 INFO L225 Difference]: With dead ends: 54 [2022-11-25 18:25:45,164 INFO L226 Difference]: Without dead ends: 24 [2022-11-25 18:25:45,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:25:45,175 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:25:45,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:25:45,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-25 18:25:45,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-25 18:25:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:25:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-11-25 18:25:45,223 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 19 [2022-11-25 18:25:45,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:25:45,224 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-11-25 18:25:45,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:25:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-11-25 18:25:45,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 18:25:45,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:45,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:25:45,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:25:45,228 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:25:45,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:45,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1988891516, now seen corresponding path program 1 times [2022-11-25 18:25:45,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:45,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804690697] [2022-11-25 18:25:45,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:45,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:45,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 18:25:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:45,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:25:45,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:25:45,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804690697] [2022-11-25 18:25:45,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804690697] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:25:45,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:25:45,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:25:45,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946305841] [2022-11-25 18:25:45,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:25:45,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:25:45,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:25:45,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:25:45,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:25:45,485 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:25:45,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:25:45,540 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-11-25 18:25:45,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:25:45,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-11-25 18:25:45,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:25:45,543 INFO L225 Difference]: With dead ends: 46 [2022-11-25 18:25:45,543 INFO L226 Difference]: Without dead ends: 28 [2022-11-25 18:25:45,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:25:45,555 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:25:45,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:25:45,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-25 18:25:45,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-11-25 18:25:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:25:45,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-11-25 18:25:45,566 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 19 [2022-11-25 18:25:45,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:25:45,566 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-11-25 18:25:45,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:25:45,567 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-11-25 18:25:45,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:25:45,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:45,568 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:25:45,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:25:45,568 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:25:45,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:45,569 INFO L85 PathProgramCache]: Analyzing trace with hash 208174980, now seen corresponding path program 1 times [2022-11-25 18:25:45,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:45,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206977623] [2022-11-25 18:25:45,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:45,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:45,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:25:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:45,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 18:25:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:45,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 18:25:45,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:25:45,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206977623] [2022-11-25 18:25:45,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206977623] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:25:45,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161625172] [2022-11-25 18:25:45,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:45,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:25:45,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:25:45,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:25:45,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:25:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:46,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 18:25:46,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:25:46,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:25:46,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:25:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 18:25:46,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161625172] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:25:46,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:25:46,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-11-25 18:25:46,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131252026] [2022-11-25 18:25:46,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:25:46,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:25:46,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:25:46,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:25:46,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:25:46,245 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 18:25:46,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:25:46,327 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-11-25 18:25:46,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:25:46,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-11-25 18:25:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:25:46,330 INFO L225 Difference]: With dead ends: 47 [2022-11-25 18:25:46,330 INFO L226 Difference]: Without dead ends: 29 [2022-11-25 18:25:46,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:25:46,332 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:25:46,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 64 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:25:46,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-25 18:25:46,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-25 18:25:46,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:25:46,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-11-25 18:25:46,337 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 28 [2022-11-25 18:25:46,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:25:46,338 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-11-25 18:25:46,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 18:25:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-11-25 18:25:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 18:25:46,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:46,341 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:25:46,352 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 18:25:46,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-25 18:25:46,547 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:25:46,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:46,548 INFO L85 PathProgramCache]: Analyzing trace with hash -941011836, now seen corresponding path program 2 times [2022-11-25 18:25:46,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:46,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373321460] [2022-11-25 18:25:46,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:46,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:46,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:25:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:46,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:25:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:46,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:25:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 18:25:46,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:25:46,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373321460] [2022-11-25 18:25:46,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373321460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:25:46,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:25:46,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:25:46,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96555675] [2022-11-25 18:25:46,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:25:46,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:25:46,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:25:46,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:25:46,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:25:46,679 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:25:46,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:25:46,714 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-11-25 18:25:46,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:25:46,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2022-11-25 18:25:46,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:25:46,716 INFO L225 Difference]: With dead ends: 45 [2022-11-25 18:25:46,716 INFO L226 Difference]: Without dead ends: 38 [2022-11-25 18:25:46,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:25:46,717 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:25:46,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 64 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:25:46,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-25 18:25:46,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2022-11-25 18:25:46,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:25:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-11-25 18:25:46,724 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 37 [2022-11-25 18:25:46,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:25:46,724 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-11-25 18:25:46,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:25:46,725 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-11-25 18:25:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 18:25:46,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:46,726 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:25:46,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:25:46,726 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:25:46,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:46,728 INFO L85 PathProgramCache]: Analyzing trace with hash -883753534, now seen corresponding path program 1 times [2022-11-25 18:25:46,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:46,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805263492] [2022-11-25 18:25:46,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:46,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:46,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:25:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:46,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:25:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:46,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:25:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 18:25:47,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:25:47,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805263492] [2022-11-25 18:25:47,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805263492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:25:47,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:25:47,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:25:47,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785023983] [2022-11-25 18:25:47,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:25:47,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:25:47,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:25:47,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:25:47,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:25:47,005 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:25:47,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:25:47,048 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-11-25 18:25:47,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:25:47,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-11-25 18:25:47,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:25:47,050 INFO L225 Difference]: With dead ends: 38 [2022-11-25 18:25:47,050 INFO L226 Difference]: Without dead ends: 30 [2022-11-25 18:25:47,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:25:47,051 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:25:47,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:25:47,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-25 18:25:47,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-25 18:25:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:25:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-11-25 18:25:47,059 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 37 [2022-11-25 18:25:47,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:25:47,059 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-11-25 18:25:47,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:25:47,060 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-11-25 18:25:47,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 18:25:47,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:47,061 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:25:47,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:25:47,061 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:25:47,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:47,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1457377551, now seen corresponding path program 1 times [2022-11-25 18:25:47,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:47,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886122584] [2022-11-25 18:25:47,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:47,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:47,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:25:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:47,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:25:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:48,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:25:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 18:25:48,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:25:48,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886122584] [2022-11-25 18:25:48,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886122584] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:25:48,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771218967] [2022-11-25 18:25:48,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:48,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:25:48,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:25:48,195 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:25:48,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:25:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:48,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-25 18:25:48,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:25:48,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-25 18:25:48,727 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (not (= |c_node_create_#res#1.base| 0)) (exists ((v_ArrVal_545 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_545)))) is different from true [2022-11-25 18:25:48,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:25:48,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 18:25:49,027 INFO L321 Elim1Store]: treesize reduction 36, result has 56.6 percent of original size [2022-11-25 18:25:49,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 63 [2022-11-25 18:25:55,621 WARN L233 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 63 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:25:55,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:25:55,805 INFO L321 Elim1Store]: treesize reduction 72, result has 54.1 percent of original size [2022-11-25 18:25:55,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 79 treesize of output 155 [2022-11-25 18:25:57,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:26:04,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:26:16,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:26:17,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:26:17,355 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 18:26:17,359 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 18:26:17,543 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 18:26:17,546 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 18:26:17,928 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 18:26:17,931 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 18:26:18,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 94 [2022-11-25 18:26:19,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2022-11-25 18:26:19,384 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:26:19,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 55 [2022-11-25 18:26:19,399 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 18:26:19,534 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 18:26:19,668 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:26:19,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2022-11-25 18:26:19,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-25 18:26:19,845 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-11-25 18:26:19,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:26:19,855 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from false [2022-11-25 18:26:20,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771218967] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:26:20,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:26:20,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 31 [2022-11-25 18:26:20,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480331055] [2022-11-25 18:26:20,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:26:20,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 18:26:20,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:20,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 18:26:20,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=987, Unknown=23, NotChecked=130, Total=1260 [2022-11-25 18:26:20,228 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 31 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 25 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-25 18:26:30,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:26:30,520 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2022-11-25 18:26:30,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 18:26:30,528 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 25 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-11-25 18:26:30,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:26:30,533 INFO L225 Difference]: With dead ends: 55 [2022-11-25 18:26:30,533 INFO L226 Difference]: Without dead ends: 48 [2022-11-25 18:26:30,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=345, Invalid=1896, Unknown=23, NotChecked=186, Total=2450 [2022-11-25 18:26:30,540 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 213 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:26:30,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 168 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 253 Invalid, 0 Unknown, 39 Unchecked, 0.3s Time] [2022-11-25 18:26:30,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-25 18:26:30,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2022-11-25 18:26:30,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:26:30,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-11-25 18:26:30,558 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 38 [2022-11-25 18:26:30,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:26:30,563 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-11-25 18:26:30,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 25 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-25 18:26:30,565 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-11-25 18:26:30,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 18:26:30,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:26:30,568 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:26:30,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:26:30,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 18:26:30,769 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:26:30,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:30,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1457379225, now seen corresponding path program 1 times [2022-11-25 18:26:30,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:30,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951730702] [2022-11-25 18:26:30,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:30,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:32,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:26:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:32,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:26:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:32,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:26:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:32,692 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 18:26:32,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:32,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951730702] [2022-11-25 18:26:32,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951730702] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:26:32,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899835476] [2022-11-25 18:26:32,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:32,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:26:32,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:26:32,694 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:26:32,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:26:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:33,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 126 conjunts are in the unsatisfiable core [2022-11-25 18:26:33,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:26:33,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:26:33,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:26:33,313 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:26:33,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 18:26:33,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:26:33,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:26:33,618 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:26:33,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 18:26:33,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:26:33,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 18:26:34,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-25 18:26:34,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:26:34,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 18:26:34,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:26:34,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 18:26:34,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:26:34,302 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 18:26:34,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2022-11-25 18:26:34,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 18:26:34,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:26:34,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 18:26:34,683 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:26:34,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 71 [2022-11-25 18:26:34,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:26:34,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2022-11-25 18:26:34,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-11-25 18:26:34,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:26:34,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2022-11-25 18:26:34,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:26:34,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2022-11-25 18:26:34,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 18:26:34,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2022-11-25 18:26:34,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2022-11-25 18:26:35,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:26:35,096 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:26:35,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:26:35,110 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_728) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-25 18:26:35,122 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_727 Int) (v_ArrVal_730 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 v_ArrVal_727)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_728) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-25 18:26:36,926 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_728 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_10| Int) (v_ArrVal_727 Int) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_10| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_10| 4))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_727)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_728) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_724) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-25 18:26:37,071 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_738 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_10| Int) (v_ArrVal_727 Int) (v_ArrVal_729 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| Int) (v_ArrVal_740 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| v_ArrVal_739))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14|) 0)) (= (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| v_ArrVal_740))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_10| 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| v_ArrVal_738))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_727))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| v_ArrVal_728) (select (select (store (store .cse3 .cse1 v_ArrVal_724) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| v_ArrVal_729) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|) (< |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| |c_#StackHeapBarrier|))))) is different from false [2022-11-25 18:26:37,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899835476] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:26:37,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:26:37,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 40 [2022-11-25 18:26:37,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956004940] [2022-11-25 18:26:37,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:26:37,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-25 18:26:37,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:37,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-25 18:26:37,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1499, Unknown=33, NotChecked=324, Total=1980 [2022-11-25 18:26:37,077 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 40 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 32 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:26:39,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:26:39,264 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-11-25 18:26:39,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:26:39,265 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 32 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2022-11-25 18:26:39,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:26:39,265 INFO L225 Difference]: With dead ends: 45 [2022-11-25 18:26:39,266 INFO L226 Difference]: Without dead ends: 43 [2022-11-25 18:26:39,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=327, Invalid=2626, Unknown=33, NotChecked=436, Total=3422 [2022-11-25 18:26:39,268 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 170 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:26:39,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 243 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 18:26:39,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-25 18:26:39,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2022-11-25 18:26:39,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:26:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-11-25 18:26:39,280 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 38 [2022-11-25 18:26:39,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:26:39,281 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-11-25 18:26:39,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 32 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:26:39,281 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-11-25 18:26:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 18:26:39,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:26:39,282 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:26:39,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:26:39,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:26:39,490 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:26:39,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:39,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1501961106, now seen corresponding path program 2 times [2022-11-25 18:26:39,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:39,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449054138] [2022-11-25 18:26:39,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:39,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:39,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:26:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:39,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:26:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:39,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:26:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:39,679 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 18:26:39,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:39,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449054138] [2022-11-25 18:26:39,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449054138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:39,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:39,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:26:39,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102139407] [2022-11-25 18:26:39,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:39,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:26:39,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:39,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:26:39,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:26:39,682 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:26:39,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:26:39,738 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2022-11-25 18:26:39,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:26:39,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-11-25 18:26:39,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:26:39,740 INFO L225 Difference]: With dead ends: 42 [2022-11-25 18:26:39,740 INFO L226 Difference]: Without dead ends: 32 [2022-11-25 18:26:39,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:26:39,742 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 33 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:26:39,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 55 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:26:39,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-25 18:26:39,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-25 18:26:39,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:26:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-11-25 18:26:39,761 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 39 [2022-11-25 18:26:39,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:26:39,764 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-11-25 18:26:39,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:26:39,764 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-11-25 18:26:39,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 18:26:39,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:26:39,767 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:26:39,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:26:39,768 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:26:39,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:39,768 INFO L85 PathProgramCache]: Analyzing trace with hash 382129514, now seen corresponding path program 1 times [2022-11-25 18:26:39,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:39,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748085221] [2022-11-25 18:26:39,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:39,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:40,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:26:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:40,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:26:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:40,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:26:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 18:26:41,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:41,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748085221] [2022-11-25 18:26:41,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748085221] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:26:41,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266803094] [2022-11-25 18:26:41,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:41,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:26:41,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:26:41,247 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:26:41,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2accb09c-11c5-41fa-99f3-7cea522290f5/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:26:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:41,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 104 conjunts are in the unsatisfiable core [2022-11-25 18:26:41,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:26:41,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:26:41,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:26:42,043 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 18:26:42,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 20 [2022-11-25 18:26:42,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 18:26:42,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:26:42,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:26:42,303 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 18:26:42,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 18:26:42,320 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 18:26:42,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-25 18:26:42,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:26:42,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 18:26:42,829 INFO L321 Elim1Store]: treesize reduction 88, result has 50.6 percent of original size [2022-11-25 18:26:42,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 93 treesize of output 138 [2022-11-25 18:26:42,855 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-25 18:26:42,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 18:27:34,136 WARN L233 SmtUtils]: Spent 41.44s on a formula simplification. DAG size of input: 210 DAG size of output: 128 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:27:34,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:27:56,449 WARN L233 SmtUtils]: Spent 22.12s on a formula simplification. DAG size of input: 1192 DAG size of output: 993 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-25 18:27:56,453 INFO L321 Elim1Store]: treesize reduction 772, result has 74.0 percent of original size [2022-11-25 18:27:56,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 2 disjoint index pairs (out of 190 index pairs), introduced 29 new quantified variables, introduced 209 case distinctions, treesize of input 581 treesize of output 2540 [2022-11-25 18:27:57,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:27:57,568 INFO L217 Elim1Store]: Index analysis took 560 ms [2022-11-25 18:27:59,697 INFO L321 Elim1Store]: treesize reduction 138, result has 65.7 percent of original size [2022-11-25 18:27:59,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 35 case distinctions, treesize of input 399 treesize of output 646