./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:06:57,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:06:57,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:06:57,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:06:57,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:06:57,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:06:57,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:06:57,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:06:57,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:06:57,750 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:06:57,751 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:06:57,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:06:57,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:06:57,754 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:06:57,755 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:06:57,756 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:06:57,757 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:06:57,758 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:06:57,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:06:57,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:06:57,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:06:57,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:06:57,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:06:57,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:06:57,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:06:57,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:06:57,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:06:57,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:06:57,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:06:57,775 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:06:57,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:06:57,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:06:57,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:06:57,778 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:06:57,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:06:57,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:06:57,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:06:57,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:06:57,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:06:57,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:06:57,782 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:06:57,783 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:06:57,804 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:06:57,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:06:57,805 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:06:57,805 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:06:57,805 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:06:57,806 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:06:57,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:06:57,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:06:57,807 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:06:57,807 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:06:57,807 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:06:57,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:06:57,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:06:57,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:06:57,808 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:06:57,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:06:57,809 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:06:57,809 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:06:57,809 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:06:57,809 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:06:57,810 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:06:57,810 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:06:57,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:06:57,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:06:57,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:06:57,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:06:57,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:06:57,811 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:06:57,811 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:06:57,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:06:57,812 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:06:57,812 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:06:57,812 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:06:57,813 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 [2022-11-02 21:06:58,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:06:58,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:06:58,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:06:58,056 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:06:58,057 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:06:58,058 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2022-11-02 21:06:58,125 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/data/6b5819ec6/42e00829c656471da2938da6b20b0b0b/FLAGb5a2dedd1 [2022-11-02 21:06:58,688 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:06:58,693 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2022-11-02 21:06:58,711 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/data/6b5819ec6/42e00829c656471da2938da6b20b0b0b/FLAGb5a2dedd1 [2022-11-02 21:06:58,964 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/data/6b5819ec6/42e00829c656471da2938da6b20b0b0b [2022-11-02 21:06:58,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:06:58,968 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:06:58,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:06:58,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:06:58,978 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:06:58,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:06:58" (1/1) ... [2022-11-02 21:06:58,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce31fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:58, skipping insertion in model container [2022-11-02 21:06:58,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:06:58" (1/1) ... [2022-11-02 21:06:58,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:06:59,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:06:59,481 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i[24361,24374] [2022-11-02 21:06:59,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:06:59,509 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:06:59,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i[24361,24374] [2022-11-02 21:06:59,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:06:59,611 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:06:59,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:59 WrapperNode [2022-11-02 21:06:59,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:06:59,613 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:06:59,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:06:59,613 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:06:59,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:59" (1/1) ... [2022-11-02 21:06:59,637 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:59" (1/1) ... [2022-11-02 21:06:59,663 INFO L138 Inliner]: procedures = 127, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2022-11-02 21:06:59,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:06:59,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:06:59,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:06:59,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:06:59,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:59" (1/1) ... [2022-11-02 21:06:59,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:59" (1/1) ... [2022-11-02 21:06:59,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:59" (1/1) ... [2022-11-02 21:06:59,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:59" (1/1) ... [2022-11-02 21:06:59,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:59" (1/1) ... [2022-11-02 21:06:59,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:59" (1/1) ... [2022-11-02 21:06:59,718 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:59" (1/1) ... [2022-11-02 21:06:59,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:59" (1/1) ... [2022-11-02 21:06:59,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:06:59,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:06:59,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:06:59,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:06:59,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:59" (1/1) ... [2022-11-02 21:06:59,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:06:59,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:06:59,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:06:59,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:06:59,827 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-02 21:06:59,828 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-02 21:06:59,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:06:59,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:06:59,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:06:59,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:06:59,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:06:59,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:06:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:06:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:06:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 21:06:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:06:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:06:59,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:07:00,026 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:07:00,028 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:07:00,078 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-02 21:07:00,347 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:07:00,353 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:07:00,353 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 21:07:00,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:07:00 BoogieIcfgContainer [2022-11-02 21:07:00,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:07:00,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:07:00,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:07:00,375 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:07:00,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:06:58" (1/3) ... [2022-11-02 21:07:00,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b333c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:07:00, skipping insertion in model container [2022-11-02 21:07:00,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:06:59" (2/3) ... [2022-11-02 21:07:00,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b333c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:07:00, skipping insertion in model container [2022-11-02 21:07:00,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:07:00" (3/3) ... [2022-11-02 21:07:00,378 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2022-11-02 21:07:00,397 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:07:00,397 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:07:00,488 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:07:00,497 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;@1390b534, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:07:00,498 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:07:00,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 25 states have (on average 1.52) internal successors, (38), 27 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:00,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 21:07:00,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:00,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:00,514 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:00,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:00,519 INFO L85 PathProgramCache]: Analyzing trace with hash 692830707, now seen corresponding path program 1 times [2022-11-02 21:07:00,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:00,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58064235] [2022-11-02 21:07:00,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:00,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:00,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:00,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58064235] [2022-11-02 21:07:00,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58064235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:00,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:00,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:00,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992091480] [2022-11-02 21:07:00,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:00,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:07:00,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:00,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:07:00,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:07:00,788 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.52) internal successors, (38), 27 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:00,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:00,808 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-11-02 21:07:00,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:07:00,811 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 21:07:00,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:00,817 INFO L225 Difference]: With dead ends: 50 [2022-11-02 21:07:00,818 INFO L226 Difference]: Without dead ends: 20 [2022-11-02 21:07:00,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:07:00,824 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:00,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:07:00,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-02 21:07:00,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-02 21:07:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-11-02 21:07:00,860 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2022-11-02 21:07:00,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:00,861 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-11-02 21:07:00,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-11-02 21:07:00,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 21:07:00,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:00,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:00,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:07:00,863 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:00,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:00,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1759740954, now seen corresponding path program 1 times [2022-11-02 21:07:00,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:00,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267949242] [2022-11-02 21:07:00,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:00,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:01,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:01,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267949242] [2022-11-02 21:07:01,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267949242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:01,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:01,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:07:01,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862274666] [2022-11-02 21:07:01,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:01,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:01,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:01,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:01,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:01,056 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:01,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:01,076 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-11-02 21:07:01,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:01,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 21:07:01,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:01,081 INFO L225 Difference]: With dead ends: 38 [2022-11-02 21:07:01,081 INFO L226 Difference]: Without dead ends: 25 [2022-11-02 21:07:01,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:01,084 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:01,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:07:01,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-02 21:07:01,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-11-02 21:07:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-11-02 21:07:01,095 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2022-11-02 21:07:01,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:01,097 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-11-02 21:07:01,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-11-02 21:07:01,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 21:07:01,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:01,100 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-02 21:07:01,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:07:01,101 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:01,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:01,102 INFO L85 PathProgramCache]: Analyzing trace with hash 675600054, now seen corresponding path program 1 times [2022-11-02 21:07:01,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:01,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574039318] [2022-11-02 21:07:01,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:01,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:01,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:01,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:01,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574039318] [2022-11-02 21:07:01,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574039318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:01,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:01,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:07:01,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143968730] [2022-11-02 21:07:01,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:01,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:01,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:01,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:01,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:01,287 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:01,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:01,315 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-11-02 21:07:01,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:01,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 21:07:01,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:01,317 INFO L225 Difference]: With dead ends: 43 [2022-11-02 21:07:01,318 INFO L226 Difference]: Without dead ends: 25 [2022-11-02 21:07:01,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:01,328 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:01,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 40 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:07:01,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-02 21:07:01,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-11-02 21:07:01,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:01,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-11-02 21:07:01,341 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2022-11-02 21:07:01,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:01,342 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-11-02 21:07:01,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:01,342 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-11-02 21:07:01,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 21:07:01,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:01,343 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-02 21:07:01,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:07:01,344 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:01,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:01,348 INFO L85 PathProgramCache]: Analyzing trace with hash -335517196, now seen corresponding path program 1 times [2022-11-02 21:07:01,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:01,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500313577] [2022-11-02 21:07:01,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:01,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:01,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:01,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500313577] [2022-11-02 21:07:01,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500313577] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:01,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016984354] [2022-11-02 21:07:01,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:01,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:01,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:01,579 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:01,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:07:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:01,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 21:07:01,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:01,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:01,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:01,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016984354] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:01,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:01,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-02 21:07:01,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923436482] [2022-11-02 21:07:01,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:01,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:07:01,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:01,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:07:01,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:07:01,894 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:01,916 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-11-02 21:07:01,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:07:01,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 21:07:01,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:01,918 INFO L225 Difference]: With dead ends: 39 [2022-11-02 21:07:01,918 INFO L226 Difference]: Without dead ends: 26 [2022-11-02 21:07:01,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:07:01,919 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:01,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 42 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:07:01,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-02 21:07:01,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-02 21:07:01,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:01,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-11-02 21:07:01,925 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2022-11-02 21:07:01,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:01,925 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-11-02 21:07:01,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:01,926 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-11-02 21:07:01,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 21:07:01,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:01,926 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] [2022-11-02 21:07:01,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:02,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-11-02 21:07:02,149 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:02,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:02,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1568046744, now seen corresponding path program 1 times [2022-11-02 21:07:02,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:02,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771287665] [2022-11-02 21:07:02,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:02,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:07:03,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:03,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771287665] [2022-11-02 21:07:03,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771287665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:03,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:03,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 21:07:03,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139176400] [2022-11-02 21:07:03,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:03,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 21:07:03,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:03,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 21:07:03,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:07:03,495 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:04,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:04,104 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-11-02 21:07:04,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:07:04,105 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 21:07:04,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:04,105 INFO L225 Difference]: With dead ends: 34 [2022-11-02 21:07:04,105 INFO L226 Difference]: Without dead ends: 32 [2022-11-02 21:07:04,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2022-11-02 21:07:04,107 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 78 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:04,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 38 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:07:04,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-02 21:07:04,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-11-02 21:07:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:04,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-11-02 21:07:04,116 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 24 [2022-11-02 21:07:04,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:04,116 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-11-02 21:07:04,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:04,117 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-11-02 21:07:04,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 21:07:04,117 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:04,118 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] [2022-11-02 21:07:04,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:07:04,118 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:04,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:04,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1568048418, now seen corresponding path program 1 times [2022-11-02 21:07:04,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:04,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488203725] [2022-11-02 21:07:04,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:04,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,411 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 21:07:04,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:04,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488203725] [2022-11-02 21:07:04,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488203725] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:04,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:04,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:07:04,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564399018] [2022-11-02 21:07:04,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:04,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:07:04,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:04,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:07:04,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:07:04,415 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:04,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:04,540 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-11-02 21:07:04,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:07:04,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 21:07:04,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:04,541 INFO L225 Difference]: With dead ends: 31 [2022-11-02 21:07:04,541 INFO L226 Difference]: Without dead ends: 28 [2022-11-02 21:07:04,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:07:04,543 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 48 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:04,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 66 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:07:04,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-02 21:07:04,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-02 21:07:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-11-02 21:07:04,550 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 24 [2022-11-02 21:07:04,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:04,551 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-11-02 21:07:04,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:04,551 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-11-02 21:07:04,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 21:07:04,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:04,552 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:04,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:07:04,553 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:04,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:04,553 INFO L85 PathProgramCache]: Analyzing trace with hash 640634787, now seen corresponding path program 1 times [2022-11-02 21:07:04,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:04,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444063945] [2022-11-02 21:07:04,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:04,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:06,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:06,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444063945] [2022-11-02 21:07:06,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444063945] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:06,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885295292] [2022-11-02 21:07:06,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:06,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:06,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:06,294 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:06,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27299a7-11fd-46af-b409-0de5c422a39c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:07:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:06,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-02 21:07:06,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:06,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:07:06,636 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:07:06,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 21:07:06,880 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-02 21:07:06,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-11-02 21:07:07,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:07,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:07,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-02 21:07:07,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 21:07:07,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:07,635 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-02 21:07:07,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2022-11-02 21:07:07,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:07,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 21:07:07,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:07,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-02 21:07:07,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 21:07:07,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:07,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-02 21:07:07,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:07,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2022-11-02 21:07:07,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 21:07:08,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:08,126 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-02 21:07:08,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 86 [2022-11-02 21:07:08,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:07:08,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:08,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2022-11-02 21:07:08,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:08,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:08,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:08,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2022-11-02 21:07:08,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:08,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-11-02 21:07:08,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:08,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 39 [2022-11-02 21:07:08,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-02 21:07:08,519 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-02 21:07:08,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 53 [2022-11-02 21:07:08,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:08,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2022-11-02 21:07:08,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 21:07:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:08,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:08,941 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_566 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|))) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) is different from false [2022-11-02 21:07:08,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_564))) (store .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)))) (.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_561))) (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ 4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) v_ArrVal_562)) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-11-02 21:07:09,046 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_562 Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (+ |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| 4))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (.cse1 (select (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse6 (let ((.cse9 (store .cse2 .cse1 v_ArrVal_564))) (store .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7|)))) (.cse3 (let ((.cse7 (store .cse8 .cse1 v_ArrVal_561))) (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_556))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 (select (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) v_ArrVal_562))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))))))) is different from false [2022-11-02 21:07:09,226 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_562 Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (+ |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| 4))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_551 .cse10 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_552 .cse10 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (.cse1 (select (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse6 (let ((.cse9 (store .cse2 .cse1 v_ArrVal_564))) (store .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7|)))) (.cse3 (let ((.cse7 (store .cse8 .cse1 v_ArrVal_561))) (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_556))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 (select (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) v_ArrVal_562))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))))))) is different from false [2022-11-02 21:07:09,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22616 treesize of output 21352 [2022-11-02 21:07:09,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1703132 treesize of output 1652122 [2022-11-02 21:07:13,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1760662 treesize of output 1690314 [2022-11-02 21:07:18,313 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:18,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1905728 treesize of output 1778040 [2022-11-02 21:07:28,150 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:28,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1951504 treesize of output 1868408 [2022-11-02 21:07:37,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2358234 treesize of output 2298474 [2022-11-02 21:07:42,615 WARN L234 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 3361 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 21:07:43,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2788138 treesize of output 2695322 [2022-11-02 21:07:49,895 WARN L234 SmtUtils]: Spent 6.77s on a formula simplification that was a NOOP. DAG size: 3337 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 21:07:50,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3135770 treesize of output 3036314 [2022-11-02 21:07:57,253 WARN L234 SmtUtils]: Spent 6.94s on a formula simplification that was a NOOP. DAG size: 3316 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 21:08:47,504 WARN L234 SmtUtils]: Spent 42.73s on a formula simplification. DAG size of input: 3304 DAG size of output: 3304 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)