./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 01:24:41,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 01:24:41,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 01:24:41,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 01:24:41,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 01:24:41,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 01:24:41,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 01:24:41,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 01:24:41,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 01:24:41,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 01:24:41,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 01:24:41,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 01:24:41,997 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 01:24:42,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 01:24:42,005 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 01:24:42,007 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 01:24:42,008 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 01:24:42,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 01:24:42,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 01:24:42,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 01:24:42,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 01:24:42,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 01:24:42,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 01:24:42,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 01:24:42,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 01:24:42,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 01:24:42,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 01:24:42,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 01:24:42,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 01:24:42,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 01:24:42,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 01:24:42,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 01:24:42,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 01:24:42,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 01:24:42,030 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 01:24:42,030 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 01:24:42,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 01:24:42,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 01:24:42,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 01:24:42,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 01:24:42,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 01:24:42,034 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-07 01:24:42,056 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 01:24:42,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 01:24:42,057 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 01:24:42,057 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 01:24:42,058 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 01:24:42,058 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 01:24:42,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 01:24:42,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 01:24:42,059 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 01:24:42,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 01:24:42,059 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 01:24:42,059 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-07 01:24:42,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 01:24:42,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 01:24:42,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 01:24:42,060 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-07 01:24:42,060 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-07 01:24:42,060 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-07 01:24:42,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 01:24:42,061 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-07 01:24:42,061 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 01:24:42,061 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 01:24:42,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 01:24:42,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 01:24:42,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 01:24:42,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:24:42,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 01:24:42,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 01:24:42,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 01:24:42,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 01:24:42,063 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 01:24:42,063 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_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/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_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 [2021-12-07 01:24:42,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 01:24:42,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 01:24:42,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 01:24:42,291 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 01:24:42,292 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 01:24:42,293 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2021-12-07 01:24:42,333 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/data/106170bc7/10a1fb62609f444c929fdecf2da6df19/FLAG04784bb9b [2021-12-07 01:24:42,834 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 01:24:42,834 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2021-12-07 01:24:42,847 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/data/106170bc7/10a1fb62609f444c929fdecf2da6df19/FLAG04784bb9b [2021-12-07 01:24:43,335 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/data/106170bc7/10a1fb62609f444c929fdecf2da6df19 [2021-12-07 01:24:43,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 01:24:43,341 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 01:24:43,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 01:24:43,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 01:24:43,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 01:24:43,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:24:43" (1/1) ... [2021-12-07 01:24:43,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78342d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:43, skipping insertion in model container [2021-12-07 01:24:43,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:24:43" (1/1) ... [2021-12-07 01:24:43,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 01:24:43,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 01:24:43,567 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_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2021-12-07 01:24:43,569 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:24:43,575 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 01:24:43,629 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_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2021-12-07 01:24:43,630 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:24:43,651 INFO L208 MainTranslator]: Completed translation [2021-12-07 01:24:43,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:43 WrapperNode [2021-12-07 01:24:43,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 01:24:43,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 01:24:43,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 01:24:43,653 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 01:24:43,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:43" (1/1) ... [2021-12-07 01:24:43,668 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:43" (1/1) ... [2021-12-07 01:24:43,688 INFO L137 Inliner]: procedures = 129, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 185 [2021-12-07 01:24:43,689 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 01:24:43,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 01:24:43,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 01:24:43,689 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 01:24:43,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:43" (1/1) ... [2021-12-07 01:24:43,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:43" (1/1) ... [2021-12-07 01:24:43,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:43" (1/1) ... [2021-12-07 01:24:43,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:43" (1/1) ... [2021-12-07 01:24:43,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:43" (1/1) ... [2021-12-07 01:24:43,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:43" (1/1) ... [2021-12-07 01:24:43,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:43" (1/1) ... [2021-12-07 01:24:43,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 01:24:43,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 01:24:43,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 01:24:43,723 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 01:24:43,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:43" (1/1) ... [2021-12-07 01:24:43,731 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:24:43,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:24:43,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 01:24:43,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 01:24:43,782 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-07 01:24:43,782 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-07 01:24:43,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-07 01:24:43,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 01:24:43,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-07 01:24:43,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-07 01:24:43,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-07 01:24:43,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-07 01:24:43,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-07 01:24:43,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 01:24:43,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 01:24:43,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 01:24:43,867 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 01:24:43,869 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 01:24:43,891 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-07 01:24:44,144 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 01:24:44,151 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 01:24:44,151 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-07 01:24:44,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:24:44 BoogieIcfgContainer [2021-12-07 01:24:44,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 01:24:44,154 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 01:24:44,154 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 01:24:44,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 01:24:44,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:24:43" (1/3) ... [2021-12-07 01:24:44,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de961ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:24:44, skipping insertion in model container [2021-12-07 01:24:44,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:24:43" (2/3) ... [2021-12-07 01:24:44,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de961ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:24:44, skipping insertion in model container [2021-12-07 01:24:44,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:24:44" (3/3) ... [2021-12-07 01:24:44,159 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-1.i [2021-12-07 01:24:44,163 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 01:24:44,163 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2021-12-07 01:24:44,199 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 01:24:44,204 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-07 01:24:44,205 INFO L340 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2021-12-07 01:24:44,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 115 states have internal predecessors, (140), 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) [2021-12-07 01:24:44,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-07 01:24:44,223 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:24:44,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-07 01:24:44,224 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:24:44,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:24:44,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1083078, now seen corresponding path program 1 times [2021-12-07 01:24:44,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:24:44,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266251502] [2021-12-07 01:24:44,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:44,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:24:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:24:44,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:24:44,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266251502] [2021-12-07 01:24:44,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266251502] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:24:44,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:24:44,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:24:44,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403096080] [2021-12-07 01:24:44,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:24:44,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-07 01:24:44,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:24:44,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-07 01:24:44,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-07 01:24:44,360 INFO L87 Difference]: Start difference. First operand has 117 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 115 states have internal predecessors, (140), 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 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2021-12-07 01:24:44,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:24:44,377 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2021-12-07 01:24:44,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-07 01:24:44,378 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2021-12-07 01:24:44,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:24:44,384 INFO L225 Difference]: With dead ends: 117 [2021-12-07 01:24:44,384 INFO L226 Difference]: Without dead ends: 111 [2021-12-07 01:24:44,385 INFO L932 BasicCegarLoop]: 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 [2021-12-07 01:24:44,388 INFO L933 BasicCegarLoop]: 132 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, 132 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 [2021-12-07 01:24:44,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:24:44,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-07 01:24:44,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-12-07 01:24:44,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 110 states have internal predecessors, (124), 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) [2021-12-07 01:24:44,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2021-12-07 01:24:44,419 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 4 [2021-12-07 01:24:44,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:24:44,419 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2021-12-07 01:24:44,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2021-12-07 01:24:44,419 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2021-12-07 01:24:44,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-07 01:24:44,420 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:24:44,420 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-07 01:24:44,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-07 01:24:44,420 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:24:44,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:24:44,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1079730, now seen corresponding path program 1 times [2021-12-07 01:24:44,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:24:44,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665643471] [2021-12-07 01:24:44,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:44,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:24:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:44,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:24:44,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:24:44,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665643471] [2021-12-07 01:24:44,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665643471] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:24:44,459 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:24:44,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:24:44,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436269819] [2021-12-07 01:24:44,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:24:44,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:24:44,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:24:44,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:24:44,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:24:44,461 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2021-12-07 01:24:44,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:24:44,532 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2021-12-07 01:24:44,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:24:44,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2021-12-07 01:24:44,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:24:44,534 INFO L225 Difference]: With dead ends: 136 [2021-12-07 01:24:44,534 INFO L226 Difference]: Without dead ends: 136 [2021-12-07 01:24:44,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:24:44,536 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 113 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:24:44,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 99 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:24:44,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-07 01:24:44,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 109. [2021-12-07 01:24:44,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 69 states have (on average 1.7681159420289856) internal successors, (122), 108 states have internal predecessors, (122), 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) [2021-12-07 01:24:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2021-12-07 01:24:44,548 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 4 [2021-12-07 01:24:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:24:44,548 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2021-12-07 01:24:44,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2021-12-07 01:24:44,548 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2021-12-07 01:24:44,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-07 01:24:44,549 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:24:44,549 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-07 01:24:44,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-07 01:24:44,549 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:24:44,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:24:44,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1079731, now seen corresponding path program 1 times [2021-12-07 01:24:44,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:24:44,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867044758] [2021-12-07 01:24:44,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:44,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:24:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:24:44,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:24:44,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867044758] [2021-12-07 01:24:44,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867044758] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:24:44,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:24:44,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:24:44,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291133794] [2021-12-07 01:24:44,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:24:44,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:24:44,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:24:44,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:24:44,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:24:44,585 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) [2021-12-07 01:24:44,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:24:44,610 INFO L93 Difference]: Finished difference Result 157 states and 175 transitions. [2021-12-07 01:24:44,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:24:44,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2021-12-07 01:24:44,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:24:44,612 INFO L225 Difference]: With dead ends: 157 [2021-12-07 01:24:44,612 INFO L226 Difference]: Without dead ends: 157 [2021-12-07 01:24:44,612 INFO L932 BasicCegarLoop]: 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 [2021-12-07 01:24:44,613 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 52 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:24:44,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 226 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:24:44,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-07 01:24:44,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 110. [2021-12-07 01:24:44,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.7571428571428571) internal successors, (123), 109 states have internal predecessors, (123), 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) [2021-12-07 01:24:44,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2021-12-07 01:24:44,621 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 4 [2021-12-07 01:24:44,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:24:44,622 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2021-12-07 01:24:44,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) [2021-12-07 01:24:44,622 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2021-12-07 01:24:44,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-07 01:24:44,622 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:24:44,622 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:24:44,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-07 01:24:44,623 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:24:44,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:24:44,623 INFO L85 PathProgramCache]: Analyzing trace with hash -336207078, now seen corresponding path program 1 times [2021-12-07 01:24:44,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:24:44,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797841935] [2021-12-07 01:24:44,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:44,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:24:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:24:44,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:24:44,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797841935] [2021-12-07 01:24:44,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797841935] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:24:44,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952596525] [2021-12-07 01:24:44,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:44,663 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:24:44,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:24:44,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:24:44,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-07 01:24:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:44,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-07 01:24:44,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:24:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:24:44,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:24:44,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:24:44,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952596525] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:24:44,817 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:24:44,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-07 01:24:44,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575807985] [2021-12-07 01:24:44,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:24:44,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 01:24:44,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:24:44,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 01:24:44,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:24:44,818 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:24:44,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:24:44,870 INFO L93 Difference]: Finished difference Result 244 states and 268 transitions. [2021-12-07 01:24:44,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 01:24:44,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-07 01:24:44,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:24:44,873 INFO L225 Difference]: With dead ends: 244 [2021-12-07 01:24:44,873 INFO L226 Difference]: Without dead ends: 244 [2021-12-07 01:24:44,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:24:44,875 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 319 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:24:44,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 603 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:24:44,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-12-07 01:24:44,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 173. [2021-12-07 01:24:44,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 133 states have (on average 1.7518796992481203) internal successors, (233), 172 states have internal predecessors, (233), 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) [2021-12-07 01:24:44,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 233 transitions. [2021-12-07 01:24:44,889 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 233 transitions. Word has length 9 [2021-12-07 01:24:44,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:24:44,889 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 233 transitions. [2021-12-07 01:24:44,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:24:44,890 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 233 transitions. [2021-12-07 01:24:44,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-07 01:24:44,890 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:24:44,890 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:24:44,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-07 01:24:45,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:24:45,092 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:24:45,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:24:45,094 INFO L85 PathProgramCache]: Analyzing trace with hash -991177183, now seen corresponding path program 1 times [2021-12-07 01:24:45,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:24:45,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864178606] [2021-12-07 01:24:45,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:45,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:24:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:24:45,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:24:45,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864178606] [2021-12-07 01:24:45,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864178606] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:24:45,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:24:45,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:24:45,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762702401] [2021-12-07 01:24:45,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:24:45,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:24:45,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:24:45,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:24:45,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:24:45,226 INFO L87 Difference]: Start difference. First operand 173 states and 233 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) [2021-12-07 01:24:45,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:24:45,302 INFO L93 Difference]: Finished difference Result 329 states and 444 transitions. [2021-12-07 01:24:45,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:24:45,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2021-12-07 01:24:45,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:24:45,304 INFO L225 Difference]: With dead ends: 329 [2021-12-07 01:24:45,304 INFO L226 Difference]: Without dead ends: 329 [2021-12-07 01:24:45,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:24:45,305 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 111 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:24:45,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 270 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:24:45,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-12-07 01:24:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 172. [2021-12-07 01:24:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 133 states have (on average 1.7293233082706767) internal successors, (230), 171 states have internal predecessors, (230), 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) [2021-12-07 01:24:45,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 230 transitions. [2021-12-07 01:24:45,317 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 230 transitions. Word has length 11 [2021-12-07 01:24:45,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:24:45,317 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 230 transitions. [2021-12-07 01:24:45,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) [2021-12-07 01:24:45,318 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 230 transitions. [2021-12-07 01:24:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-07 01:24:45,318 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:24:45,318 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:24:45,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-07 01:24:45,319 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:24:45,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:24:45,319 INFO L85 PathProgramCache]: Analyzing trace with hash -991177182, now seen corresponding path program 1 times [2021-12-07 01:24:45,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:24:45,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012603178] [2021-12-07 01:24:45,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:45,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:24:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:24:45,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:24:45,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012603178] [2021-12-07 01:24:45,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012603178] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:24:45,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:24:45,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:24:45,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71296590] [2021-12-07 01:24:45,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:24:45,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:24:45,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:24:45,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:24:45,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:24:45,365 INFO L87 Difference]: Start difference. First operand 172 states and 230 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) [2021-12-07 01:24:45,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:24:45,434 INFO L93 Difference]: Finished difference Result 330 states and 442 transitions. [2021-12-07 01:24:45,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:24:45,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2021-12-07 01:24:45,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:24:45,436 INFO L225 Difference]: With dead ends: 330 [2021-12-07 01:24:45,436 INFO L226 Difference]: Without dead ends: 330 [2021-12-07 01:24:45,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:24:45,437 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 114 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:24:45,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 278 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:24:45,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-12-07 01:24:45,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 171. [2021-12-07 01:24:45,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.7067669172932332) internal successors, (227), 170 states have internal predecessors, (227), 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) [2021-12-07 01:24:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 227 transitions. [2021-12-07 01:24:45,452 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 227 transitions. Word has length 11 [2021-12-07 01:24:45,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:24:45,452 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 227 transitions. [2021-12-07 01:24:45,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) [2021-12-07 01:24:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2021-12-07 01:24:45,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-07 01:24:45,453 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:24:45,453 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:24:45,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-07 01:24:45,454 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:24:45,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:24:45,454 INFO L85 PathProgramCache]: Analyzing trace with hash -661772220, now seen corresponding path program 1 times [2021-12-07 01:24:45,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:24:45,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069019674] [2021-12-07 01:24:45,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:45,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:24:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:24:45,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:24:45,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069019674] [2021-12-07 01:24:45,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069019674] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:24:45,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:24:45,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:24:45,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438227812] [2021-12-07 01:24:45,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:24:45,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:24:45,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:24:45,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:24:45,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:24:45,484 INFO L87 Difference]: Start difference. First operand 171 states and 227 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:24:45,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:24:45,534 INFO L93 Difference]: Finished difference Result 244 states and 312 transitions. [2021-12-07 01:24:45,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:24:45,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-07 01:24:45,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:24:45,536 INFO L225 Difference]: With dead ends: 244 [2021-12-07 01:24:45,536 INFO L226 Difference]: Without dead ends: 244 [2021-12-07 01:24:45,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:24:45,537 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 105 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:24:45,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 204 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:24:45,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-12-07 01:24:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 169. [2021-12-07 01:24:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 168 states have internal predecessors, (221), 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) [2021-12-07 01:24:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 221 transitions. [2021-12-07 01:24:45,542 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 221 transitions. Word has length 12 [2021-12-07 01:24:45,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:24:45,542 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 221 transitions. [2021-12-07 01:24:45,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:24:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 221 transitions. [2021-12-07 01:24:45,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-07 01:24:45,543 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:24:45,543 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:24:45,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-07 01:24:45,543 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:24:45,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:24:45,543 INFO L85 PathProgramCache]: Analyzing trace with hash -661772219, now seen corresponding path program 1 times [2021-12-07 01:24:45,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:24:45,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689579244] [2021-12-07 01:24:45,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:45,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:24:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:45,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:24:45,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:24:45,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689579244] [2021-12-07 01:24:45,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689579244] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:24:45,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:24:45,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:24:45,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049972710] [2021-12-07 01:24:45,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:24:45,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:24:45,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:24:45,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:24:45,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:24:45,576 INFO L87 Difference]: Start difference. First operand 169 states and 221 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:24:45,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:24:45,645 INFO L93 Difference]: Finished difference Result 376 states and 459 transitions. [2021-12-07 01:24:45,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 01:24:45,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-07 01:24:45,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:24:45,647 INFO L225 Difference]: With dead ends: 376 [2021-12-07 01:24:45,648 INFO L226 Difference]: Without dead ends: 376 [2021-12-07 01:24:45,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:24:45,649 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 231 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:24:45,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 812 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:24:45,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-12-07 01:24:45,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 172. [2021-12-07 01:24:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.6470588235294117) internal successors, (224), 171 states have internal predecessors, (224), 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) [2021-12-07 01:24:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 224 transitions. [2021-12-07 01:24:45,656 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 224 transitions. Word has length 12 [2021-12-07 01:24:45,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:24:45,656 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 224 transitions. [2021-12-07 01:24:45,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:24:45,656 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 224 transitions. [2021-12-07 01:24:45,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-07 01:24:45,657 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:24:45,657 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:24:45,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-07 01:24:45,657 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:24:45,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:24:45,658 INFO L85 PathProgramCache]: Analyzing trace with hash -51661170, now seen corresponding path program 1 times [2021-12-07 01:24:45,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:24:45,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736929259] [2021-12-07 01:24:45,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:45,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:24:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:24:45,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:24:45,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736929259] [2021-12-07 01:24:45,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736929259] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:24:45,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320239518] [2021-12-07 01:24:45,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:45,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:24:45,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:24:45,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:24:45,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-07 01:24:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:45,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-07 01:24:45,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:24:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:24:45,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:24:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:24:45,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320239518] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:24:45,830 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:24:45,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2021-12-07 01:24:45,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619428435] [2021-12-07 01:24:45,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:24:45,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 01:24:45,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:24:45,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 01:24:45,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:24:45,831 INFO L87 Difference]: Start difference. First operand 172 states and 224 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 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) [2021-12-07 01:24:45,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:24:45,900 INFO L93 Difference]: Finished difference Result 391 states and 474 transitions. [2021-12-07 01:24:45,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 01:24:45,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 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) Word has length 16 [2021-12-07 01:24:45,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:24:45,902 INFO L225 Difference]: With dead ends: 391 [2021-12-07 01:24:45,902 INFO L226 Difference]: Without dead ends: 391 [2021-12-07 01:24:45,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-12-07 01:24:45,903 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 477 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:24:45,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [477 Valid, 814 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:24:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-12-07 01:24:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 196. [2021-12-07 01:24:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 160 states have (on average 1.55) internal successors, (248), 195 states have internal predecessors, (248), 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) [2021-12-07 01:24:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 248 transitions. [2021-12-07 01:24:45,908 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 248 transitions. Word has length 16 [2021-12-07 01:24:45,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:24:45,908 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 248 transitions. [2021-12-07 01:24:45,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 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) [2021-12-07 01:24:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 248 transitions. [2021-12-07 01:24:45,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-07 01:24:45,909 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:24:45,909 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1] [2021-12-07 01:24:45,937 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-07 01:24:46,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:24:46,110 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:24:46,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:24:46,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1254577850, now seen corresponding path program 2 times [2021-12-07 01:24:46,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:24:46,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396220889] [2021-12-07 01:24:46,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:46,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:24:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-07 01:24:46,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:24:46,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396220889] [2021-12-07 01:24:46,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396220889] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:24:46,204 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:24:46,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:24:46,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443829123] [2021-12-07 01:24:46,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:24:46,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:24:46,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:24:46,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:24:46,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:24:46,206 INFO L87 Difference]: Start difference. First operand 196 states and 248 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:24:46,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:24:46,243 INFO L93 Difference]: Finished difference Result 194 states and 246 transitions. [2021-12-07 01:24:46,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:24:46,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-07 01:24:46,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:24:46,244 INFO L225 Difference]: With dead ends: 194 [2021-12-07 01:24:46,244 INFO L226 Difference]: Without dead ends: 194 [2021-12-07 01:24:46,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:24:46,245 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 104 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:24:46,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 83 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:24:46,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-07 01:24:46,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2021-12-07 01:24:46,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 160 states have (on average 1.5375) internal successors, (246), 193 states have internal predecessors, (246), 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) [2021-12-07 01:24:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 246 transitions. [2021-12-07 01:24:46,249 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 246 transitions. Word has length 19 [2021-12-07 01:24:46,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:24:46,249 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 246 transitions. [2021-12-07 01:24:46,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:24:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 246 transitions. [2021-12-07 01:24:46,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-07 01:24:46,250 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:24:46,250 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:24:46,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-07 01:24:46,250 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:24:46,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:24:46,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1435011604, now seen corresponding path program 1 times [2021-12-07 01:24:46,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:24:46,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226634432] [2021-12-07 01:24:46,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:46,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:24:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-07 01:24:46,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:24:46,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226634432] [2021-12-07 01:24:46,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226634432] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:24:46,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:24:46,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:24:46,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102384749] [2021-12-07 01:24:46,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:24:46,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:24:46,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:24:46,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:24:46,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:24:46,290 INFO L87 Difference]: Start difference. First operand 194 states and 246 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2021-12-07 01:24:46,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:24:46,336 INFO L93 Difference]: Finished difference Result 258 states and 319 transitions. [2021-12-07 01:24:46,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 01:24:46,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 23 [2021-12-07 01:24:46,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:24:46,337 INFO L225 Difference]: With dead ends: 258 [2021-12-07 01:24:46,337 INFO L226 Difference]: Without dead ends: 258 [2021-12-07 01:24:46,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:24:46,338 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 102 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:24:46,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 375 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:24:46,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-12-07 01:24:46,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 213. [2021-12-07 01:24:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 179 states have (on average 1.5195530726256983) internal successors, (272), 212 states have internal predecessors, (272), 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) [2021-12-07 01:24:46,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 272 transitions. [2021-12-07 01:24:46,343 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 272 transitions. Word has length 23 [2021-12-07 01:24:46,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:24:46,343 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 272 transitions. [2021-12-07 01:24:46,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2021-12-07 01:24:46,343 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 272 transitions. [2021-12-07 01:24:46,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-07 01:24:46,344 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:24:46,344 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:24:46,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-07 01:24:46,344 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:24:46,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:24:46,345 INFO L85 PathProgramCache]: Analyzing trace with hash 877276576, now seen corresponding path program 2 times [2021-12-07 01:24:46,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:24:46,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334891659] [2021-12-07 01:24:46,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:46,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:24:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-07 01:24:46,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:24:46,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334891659] [2021-12-07 01:24:46,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334891659] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:24:46,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714818976] [2021-12-07 01:24:46,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-07 01:24:46,435 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:24:46,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:24:46,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:24:46,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-07 01:24:46,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-07 01:24:46,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:24:46,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-07 01:24:46,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:24:46,528 INFO L388 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 [2021-12-07 01:24:46,534 INFO L388 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 [2021-12-07 01:24:46,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:24:46,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-07 01:24:46,579 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-07 01:24:46,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-07 01:24:46,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:24:46,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-07 01:24:46,620 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-07 01:24:46,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-07 01:24:46,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:24:46,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-07 01:24:46,700 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-07 01:24:46,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-07 01:24:46,729 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:24:46,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:24:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:24:47,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714818976] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:24:47,430 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:24:47,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2021-12-07 01:24:47,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813786943] [2021-12-07 01:24:47,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:24:47,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 01:24:47,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:24:47,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 01:24:47,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:24:47,432 INFO L87 Difference]: Start difference. First operand 213 states and 272 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:24:47,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:24:47,512 INFO L93 Difference]: Finished difference Result 212 states and 269 transitions. [2021-12-07 01:24:47,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:24:47,512 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-07 01:24:47,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:24:47,513 INFO L225 Difference]: With dead ends: 212 [2021-12-07 01:24:47,513 INFO L226 Difference]: Without dead ends: 212 [2021-12-07 01:24:47,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2021-12-07 01:24:47,514 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 9 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:24:47,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 387 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 56 Unchecked, 0.1s Time] [2021-12-07 01:24:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-12-07 01:24:47,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2021-12-07 01:24:47,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 179 states have (on average 1.5027932960893855) internal successors, (269), 211 states have internal predecessors, (269), 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) [2021-12-07 01:24:47,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 269 transitions. [2021-12-07 01:24:47,518 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 269 transitions. Word has length 24 [2021-12-07 01:24:47,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:24:47,519 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 269 transitions. [2021-12-07 01:24:47,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:24:47,519 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 269 transitions. [2021-12-07 01:24:47,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-07 01:24:47,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:24:47,520 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:24:47,540 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-07 01:24:47,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:24:47,723 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:24:47,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:24:47,725 INFO L85 PathProgramCache]: Analyzing trace with hash 361607171, now seen corresponding path program 1 times [2021-12-07 01:24:47,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:24:47,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200990628] [2021-12-07 01:24:47,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:47,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:24:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:47,808 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-07 01:24:47,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:24:47,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200990628] [2021-12-07 01:24:47,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200990628] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:24:47,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:24:47,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:24:47,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462188447] [2021-12-07 01:24:47,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:24:47,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:24:47,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:24:47,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:24:47,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:24:47,810 INFO L87 Difference]: Start difference. First operand 212 states and 269 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-12-07 01:24:47,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:24:47,863 INFO L93 Difference]: Finished difference Result 232 states and 289 transitions. [2021-12-07 01:24:47,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 01:24:47,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 25 [2021-12-07 01:24:47,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:24:47,864 INFO L225 Difference]: With dead ends: 232 [2021-12-07 01:24:47,864 INFO L226 Difference]: Without dead ends: 232 [2021-12-07 01:24:47,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:24:47,865 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 14 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:24:47,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 405 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:24:47,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-12-07 01:24:47,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 216. [2021-12-07 01:24:47,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 183 states have (on average 1.4918032786885247) internal successors, (273), 215 states have internal predecessors, (273), 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) [2021-12-07 01:24:47,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 273 transitions. [2021-12-07 01:24:47,869 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 273 transitions. Word has length 25 [2021-12-07 01:24:47,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:24:47,869 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 273 transitions. [2021-12-07 01:24:47,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-12-07 01:24:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 273 transitions. [2021-12-07 01:24:47,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-07 01:24:47,870 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:24:47,870 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:24:47,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-07 01:24:47,870 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:24:47,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:24:47,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1675080075, now seen corresponding path program 1 times [2021-12-07 01:24:47,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:24:47,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163292315] [2021-12-07 01:24:47,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:47,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:24:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:47,907 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-07 01:24:47,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:24:47,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163292315] [2021-12-07 01:24:47,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163292315] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:24:47,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:24:47,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:24:47,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481762610] [2021-12-07 01:24:47,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:24:47,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:24:47,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:24:47,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:24:47,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:24:47,909 INFO L87 Difference]: Start difference. First operand 216 states and 273 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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) [2021-12-07 01:24:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:24:47,971 INFO L93 Difference]: Finished difference Result 218 states and 274 transitions. [2021-12-07 01:24:47,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:24:47,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-07 01:24:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:24:47,973 INFO L225 Difference]: With dead ends: 218 [2021-12-07 01:24:47,973 INFO L226 Difference]: Without dead ends: 210 [2021-12-07 01:24:47,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:24:47,974 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:24:47,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 263 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:24:47,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-12-07 01:24:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2021-12-07 01:24:47,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 175 states have (on average 1.5085714285714287) internal successors, (264), 207 states have internal predecessors, (264), 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) [2021-12-07 01:24:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 264 transitions. [2021-12-07 01:24:47,980 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 264 transitions. Word has length 26 [2021-12-07 01:24:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:24:47,980 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 264 transitions. [2021-12-07 01:24:47,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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) [2021-12-07 01:24:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 264 transitions. [2021-12-07 01:24:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-07 01:24:47,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:24:47,981 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:24:47,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-07 01:24:47,981 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:24:47,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:24:47,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1249199777, now seen corresponding path program 1 times [2021-12-07 01:24:47,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:24:47,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599736340] [2021-12-07 01:24:47,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:47,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:24:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:48,024 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-07 01:24:48,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:24:48,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599736340] [2021-12-07 01:24:48,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599736340] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:24:48,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:24:48,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:24:48,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964834665] [2021-12-07 01:24:48,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:24:48,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:24:48,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:24:48,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:24:48,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:24:48,026 INFO L87 Difference]: Start difference. First operand 208 states and 264 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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) [2021-12-07 01:24:48,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:24:48,060 INFO L93 Difference]: Finished difference Result 207 states and 261 transitions. [2021-12-07 01:24:48,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:24:48,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-07 01:24:48,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:24:48,062 INFO L225 Difference]: With dead ends: 207 [2021-12-07 01:24:48,062 INFO L226 Difference]: Without dead ends: 207 [2021-12-07 01:24:48,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:24:48,063 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 110 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:24:48,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 102 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:24:48,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-12-07 01:24:48,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2021-12-07 01:24:48,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 175 states have (on average 1.4914285714285713) internal successors, (261), 206 states have internal predecessors, (261), 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) [2021-12-07 01:24:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 261 transitions. [2021-12-07 01:24:48,068 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 261 transitions. Word has length 26 [2021-12-07 01:24:48,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:24:48,069 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 261 transitions. [2021-12-07 01:24:48,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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) [2021-12-07 01:24:48,069 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 261 transitions. [2021-12-07 01:24:48,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-07 01:24:48,070 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:24:48,070 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:24:48,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-07 01:24:48,070 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:24:48,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:24:48,070 INFO L85 PathProgramCache]: Analyzing trace with hash -981051253, now seen corresponding path program 1 times [2021-12-07 01:24:48,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:24:48,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046978630] [2021-12-07 01:24:48,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:48,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:24:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:48,113 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-07 01:24:48,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:24:48,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046978630] [2021-12-07 01:24:48,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046978630] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:24:48,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:24:48,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:24:48,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700448004] [2021-12-07 01:24:48,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:24:48,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:24:48,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:24:48,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:24:48,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:24:48,114 INFO L87 Difference]: Start difference. First operand 207 states and 261 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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) [2021-12-07 01:24:48,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:24:48,176 INFO L93 Difference]: Finished difference Result 233 states and 287 transitions. [2021-12-07 01:24:48,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:24:48,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-07 01:24:48,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:24:48,178 INFO L225 Difference]: With dead ends: 233 [2021-12-07 01:24:48,178 INFO L226 Difference]: Without dead ends: 233 [2021-12-07 01:24:48,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:24:48,178 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 287 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:24:48,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 167 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:24:48,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-12-07 01:24:48,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 206. [2021-12-07 01:24:48,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 175 states have (on average 1.4742857142857142) internal successors, (258), 205 states have internal predecessors, (258), 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) [2021-12-07 01:24:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 258 transitions. [2021-12-07 01:24:48,183 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 258 transitions. Word has length 29 [2021-12-07 01:24:48,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:24:48,183 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 258 transitions. [2021-12-07 01:24:48,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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) [2021-12-07 01:24:48,183 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 258 transitions. [2021-12-07 01:24:48,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-07 01:24:48,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:24:48,184 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:24:48,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-07 01:24:48,184 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:24:48,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:24:48,184 INFO L85 PathProgramCache]: Analyzing trace with hash -981051252, now seen corresponding path program 1 times [2021-12-07 01:24:48,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:24:48,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57068591] [2021-12-07 01:24:48,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:48,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:24:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:48,243 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-07 01:24:48,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:24:48,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57068591] [2021-12-07 01:24:48,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57068591] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:24:48,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:24:48,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:24:48,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421484196] [2021-12-07 01:24:48,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:24:48,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:24:48,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:24:48,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:24:48,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:24:48,244 INFO L87 Difference]: Start difference. First operand 206 states and 258 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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) [2021-12-07 01:24:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:24:48,304 INFO L93 Difference]: Finished difference Result 205 states and 255 transitions. [2021-12-07 01:24:48,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:24:48,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-07 01:24:48,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:24:48,306 INFO L225 Difference]: With dead ends: 205 [2021-12-07 01:24:48,306 INFO L226 Difference]: Without dead ends: 205 [2021-12-07 01:24:48,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:24:48,307 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 396 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:24:48,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 120 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:24:48,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-12-07 01:24:48,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2021-12-07 01:24:48,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 175 states have (on average 1.457142857142857) internal successors, (255), 204 states have internal predecessors, (255), 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) [2021-12-07 01:24:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 255 transitions. [2021-12-07 01:24:48,312 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 255 transitions. Word has length 29 [2021-12-07 01:24:48,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:24:48,312 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 255 transitions. [2021-12-07 01:24:48,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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) [2021-12-07 01:24:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 255 transitions. [2021-12-07 01:24:48,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-07 01:24:48,313 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:24:48,313 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:24:48,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-07 01:24:48,313 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:24:48,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:24:48,314 INFO L85 PathProgramCache]: Analyzing trace with hash -347817722, now seen corresponding path program 1 times [2021-12-07 01:24:48,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:24:48,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824545997] [2021-12-07 01:24:48,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:48,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:24:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:48,406 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-07 01:24:48,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:24:48,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824545997] [2021-12-07 01:24:48,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824545997] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:24:48,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328065965] [2021-12-07 01:24:48,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:48,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:24:48,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:24:48,408 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:24:48,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-07 01:24:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:48,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-07 01:24:48,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:24:48,486 INFO L388 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 [2021-12-07 01:24:48,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:24:48,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-07 01:24:48,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:24:48,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-07 01:24:48,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:24:48,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-07 01:24:48,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:24:48,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-07 01:24:48,655 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-07 01:24:48,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:24:49,416 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-07 01:24:49,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328065965] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:24:49,416 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:24:49,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2021-12-07 01:24:49,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210740447] [2021-12-07 01:24:49,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:24:49,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 01:24:49,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:24:49,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 01:24:49,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:24:49,418 INFO L87 Difference]: Start difference. First operand 205 states and 255 transitions. Second operand has 11 states, 10 states have (on average 7.6) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:24:49,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:24:49,499 INFO L93 Difference]: Finished difference Result 230 states and 278 transitions. [2021-12-07 01:24:49,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:24:49,499 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-07 01:24:49,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:24:49,500 INFO L225 Difference]: With dead ends: 230 [2021-12-07 01:24:49,501 INFO L226 Difference]: Without dead ends: 230 [2021-12-07 01:24:49,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-12-07 01:24:49,501 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 424 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:24:49,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [424 Valid, 127 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 88 Invalid, 0 Unknown, 17 Unchecked, 0.1s Time] [2021-12-07 01:24:49,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-07 01:24:49,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 203. [2021-12-07 01:24:49,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 175 states have (on average 1.4228571428571428) internal successors, (249), 202 states have internal predecessors, (249), 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) [2021-12-07 01:24:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 249 transitions. [2021-12-07 01:24:49,507 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 249 transitions. Word has length 30 [2021-12-07 01:24:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:24:49,507 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 249 transitions. [2021-12-07 01:24:49,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:24:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 249 transitions. [2021-12-07 01:24:49,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-07 01:24:49,508 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:24:49,508 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:24:49,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-07 01:24:49,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-07 01:24:49,708 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:24:49,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:24:49,709 INFO L85 PathProgramCache]: Analyzing trace with hash -347817723, now seen corresponding path program 1 times [2021-12-07 01:24:49,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:24:49,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262108076] [2021-12-07 01:24:49,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:49,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:24:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:49,814 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-07 01:24:49,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:24:49,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262108076] [2021-12-07 01:24:49,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262108076] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:24:49,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989304648] [2021-12-07 01:24:49,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:49,814 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:24:49,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:24:49,815 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:24:49,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-07 01:24:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:49,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-07 01:24:49,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:24:49,888 INFO L388 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 [2021-12-07 01:24:49,919 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-07 01:24:49,919 INFO L388 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 18 [2021-12-07 01:24:49,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:24:49,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-07 01:24:49,963 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-07 01:24:49,964 INFO L388 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 16 treesize of output 22 [2021-12-07 01:24:50,013 INFO L354 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2021-12-07 01:24:50,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2021-12-07 01:24:50,123 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:24:50,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:24:50,364 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:24:50,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989304648] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:24:50,364 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:24:50,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2021-12-07 01:24:50,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765451645] [2021-12-07 01:24:50,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:24:50,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-07 01:24:50,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:24:50,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-07 01:24:50,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2021-12-07 01:24:50,366 INFO L87 Difference]: Start difference. First operand 203 states and 249 transitions. Second operand has 16 states, 15 states have (on average 4.6) internal successors, (69), 16 states have internal predecessors, (69), 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) [2021-12-07 01:24:50,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:24:50,502 INFO L93 Difference]: Finished difference Result 413 states and 498 transitions. [2021-12-07 01:24:50,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 01:24:50,502 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.6) internal successors, (69), 16 states have internal predecessors, (69), 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 30 [2021-12-07 01:24:50,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:24:50,505 INFO L225 Difference]: With dead ends: 413 [2021-12-07 01:24:50,505 INFO L226 Difference]: Without dead ends: 413 [2021-12-07 01:24:50,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-12-07 01:24:50,506 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 374 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:24:50,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 887 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 183 Invalid, 0 Unknown, 254 Unchecked, 0.1s Time] [2021-12-07 01:24:50,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-12-07 01:24:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 284. [2021-12-07 01:24:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 256 states have (on average 1.3125) internal successors, (336), 283 states have internal predecessors, (336), 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) [2021-12-07 01:24:50,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 336 transitions. [2021-12-07 01:24:50,512 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 336 transitions. Word has length 30 [2021-12-07 01:24:50,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:24:50,512 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 336 transitions. [2021-12-07 01:24:50,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.6) internal successors, (69), 16 states have internal predecessors, (69), 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) [2021-12-07 01:24:50,513 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 336 transitions. [2021-12-07 01:24:50,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-07 01:24:50,513 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:24:50,513 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:24:50,545 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-07 01:24:50,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:24:50,713 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:24:50,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:24:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1918350099, now seen corresponding path program 1 times [2021-12-07 01:24:50,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:24:50,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867948582] [2021-12-07 01:24:50,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:50,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:24:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:50,894 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-07 01:24:50,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:24:50,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867948582] [2021-12-07 01:24:50,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867948582] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:24:50,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254113281] [2021-12-07 01:24:50,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:24:50,895 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:24:50,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:24:50,895 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:24:50,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-07 01:24:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:24:50,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 51 conjunts are in the unsatisfiable core [2021-12-07 01:24:50,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:24:51,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:24:51,077 INFO L388 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 [2021-12-07 01:24:51,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:24:51,081 INFO L388 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 [2021-12-07 01:24:51,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:24:51,180 INFO L388 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 [2021-12-07 01:24:51,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:24:51,184 INFO L388 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 19 treesize of output 18 [2021-12-07 01:24:51,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:24:51,291 INFO L388 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 [2021-12-07 01:24:51,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:24:51,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:24:51,301 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-07 01:24:51,301 INFO L388 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 1 case distinctions, treesize of input 21 treesize of output 30 [2021-12-07 01:24:51,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:24:51,348 INFO L388 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 [2021-12-07 01:24:51,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:24:51,353 INFO L388 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 [2021-12-07 01:24:51,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:24:51,369 INFO L388 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 [2021-12-07 01:24:51,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:24:51,372 INFO L388 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 [2021-12-07 01:24:51,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:24:51,419 INFO L388 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 [2021-12-07 01:24:51,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:24:51,423 INFO L388 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 [2021-12-07 01:24:51,440 INFO L388 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 [2021-12-07 01:24:51,442 INFO L388 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 [2021-12-07 01:24:51,447 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:24:51,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:24:51,459 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_539 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_539) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_538 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) is different from false [2021-12-07 01:24:51,475 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_#res#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_538 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_539 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-07 01:24:51,492 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_538 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_539 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-07 01:24:51,517 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_536) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-07 01:24:51,645 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (and (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_532) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_533 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_533) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_536) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))) is different from false [2021-12-07 01:24:53,767 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_532) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_533 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_533) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_536) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))) is different from false [2021-12-07 01:24:53,978 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_533 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_533) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_536) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_530 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_530) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_532) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-07 01:24:54,210 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27|) (and (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_533 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_533) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_536) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_530 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| v_ArrVal_530) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_532) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-07 01:24:54,341 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_530 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| v_ArrVal_530) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_532) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_533 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_533) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_536) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27|))) is different from false [2021-12-07 01:24:54,541 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| Int)) (or (and (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_528 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_530 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_528) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| v_ArrVal_530) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_532) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_527 (Array Int Int)) (v_ArrVal_533 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_527))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_533) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_536) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27|))) is different from false [2021-12-07 01:24:54,871 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_28| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_527 (Array Int Int)) (v_ArrVal_533 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_28| v_ArrVal_527))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_533) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_536) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_528 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_530 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_28| v_ArrVal_528) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| v_ArrVal_530) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_532) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_28|))) is different from false [2021-12-07 01:24:55,496 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_28| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| Int) (|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| Int)) (or (and (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_528 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_530 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_28| v_ArrVal_528) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| v_ArrVal_530) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_532) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_537) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_527 (Array Int Int)) (v_ArrVal_533 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_28| v_ArrVal_527))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_533) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_536) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16|) (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_28|))) is different from false [2021-12-07 01:24:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2021-12-07 01:24:56,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254113281] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:24:56,275 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:24:56,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 17] total 36 [2021-12-07 01:24:56,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387994382] [2021-12-07 01:24:56,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:24:56,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-07 01:24:56,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:24:56,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-07 01:24:56,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=450, Unknown=12, NotChecked=660, Total=1260 [2021-12-07 01:24:56,277 INFO L87 Difference]: Start difference. First operand 284 states and 336 transitions. Second operand has 36 states, 36 states have (on average 2.388888888888889) internal successors, (86), 36 states have internal predecessors, (86), 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) [2021-12-07 01:24:58,282 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_28| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| Int) (|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| Int)) (or (and (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_528 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_530 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_28| v_ArrVal_528) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| v_ArrVal_530) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_532) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_537) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_527 (Array Int Int)) (v_ArrVal_533 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_28| v_ArrVal_527))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_533) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_536) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16|) (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_28|))) (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) is different from false [2021-12-07 01:25:00,286 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_28| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_527 (Array Int Int)) (v_ArrVal_533 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_28| v_ArrVal_527))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_533) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_536) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_528 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_530 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_28| v_ArrVal_528) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| v_ArrVal_530) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_532) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_28|)))) is different from false [2021-12-07 01:25:02,294 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| Int)) (or (and (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_528 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_530 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_528) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| v_ArrVal_530) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_532) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_527 (Array Int Int)) (v_ArrVal_533 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_527))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_533) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_536) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27|))) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-12-07 01:25:04,299 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_530 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| v_ArrVal_530) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_532) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_533 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_533) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_536) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27|))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0)) is different from false [2021-12-07 01:25:06,305 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27|) (and (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_533 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_533) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_536) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_530 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_27| v_ArrVal_530) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_532) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0)) is different from false [2021-12-07 01:25:16,335 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_533 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_533) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_536) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_530 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_530) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_532) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-12-07 01:25:18,339 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_532) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_533 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_533) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_536) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) 0) (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0)) is different from false [2021-12-07 01:25:20,344 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26|) (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_532) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_533 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_533) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_536) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) 0) (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0)) is different from false [2021-12-07 01:25:52,447 WARN L227 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 47 DAG size of output: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 01:26:22,503 WARN L227 SmtUtils]: Spent 12.02s on a formula simplification. DAG size of input: 47 DAG size of output: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 01:26:54,558 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_536) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0)) is different from false [2021-12-07 01:26:56,562 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_538 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_539 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (< (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0)) is different from false [2021-12-07 01:26:58,566 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_#res#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_538 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_538) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_539 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_539) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (< (+ |c_ULTIMATE.start_node_create_with_sublist_#res#1.base| 1) |c_ULTIMATE.start_sll_append_~head#1.base|)) is different from false [2021-12-07 01:26:58,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:26:58,660 INFO L93 Difference]: Finished difference Result 321 states and 375 transitions. [2021-12-07 01:26:58,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-07 01:26:58,660 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.388888888888889) internal successors, (86), 36 states have internal predecessors, (86), 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 33 [2021-12-07 01:26:58,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:26:58,661 INFO L225 Difference]: With dead ends: 321 [2021-12-07 01:26:58,662 INFO L226 Difference]: Without dead ends: 321 [2021-12-07 01:26:58,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 124.7s TimeCoverageRelationStatistics Valid=203, Invalid=656, Unknown=45, NotChecked=1748, Total=2652 [2021-12-07 01:26:58,663 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 11 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 405 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:26:58,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 1840 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 405 Unchecked, 0.1s Time] [2021-12-07 01:26:58,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-12-07 01:26:58,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 311. [2021-12-07 01:26:58,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 283 states have (on average 1.2897526501766785) internal successors, (365), 310 states have internal predecessors, (365), 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) [2021-12-07 01:26:58,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 365 transitions. [2021-12-07 01:26:58,668 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 365 transitions. Word has length 33 [2021-12-07 01:26:58,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:26:58,668 INFO L470 AbstractCegarLoop]: Abstraction has 311 states and 365 transitions. [2021-12-07 01:26:58,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.388888888888889) internal successors, (86), 36 states have internal predecessors, (86), 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) [2021-12-07 01:26:58,668 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 365 transitions. [2021-12-07 01:26:58,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-07 01:26:58,669 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:26:58,669 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:26:58,689 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-07 01:26:58,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:26:58,869 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:26:58,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:26:58,870 INFO L85 PathProgramCache]: Analyzing trace with hash -990413803, now seen corresponding path program 1 times [2021-12-07 01:26:58,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:26:58,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549411136] [2021-12-07 01:26:58,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:26:58,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:26:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:26:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-07 01:26:58,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:26:58,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549411136] [2021-12-07 01:26:58,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549411136] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:26:58,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:26:58,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:26:58,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690625989] [2021-12-07 01:26:58,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:26:58,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:26:58,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:26:58,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:26:58,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:26:58,893 INFO L87 Difference]: Start difference. First operand 311 states and 365 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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) [2021-12-07 01:26:58,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:26:58,900 INFO L93 Difference]: Finished difference Result 290 states and 341 transitions. [2021-12-07 01:26:58,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:26:58,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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 33 [2021-12-07 01:26:58,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:26:58,902 INFO L225 Difference]: With dead ends: 290 [2021-12-07 01:26:58,902 INFO L226 Difference]: Without dead ends: 290 [2021-12-07 01:26:58,902 INFO L932 BasicCegarLoop]: 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 [2021-12-07 01:26:58,903 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:26:58,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 214 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:26:58,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-12-07 01:26:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2021-12-07 01:26:58,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 288 states have internal predecessors, (340), 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) [2021-12-07 01:26:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 340 transitions. [2021-12-07 01:26:58,910 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 340 transitions. Word has length 33 [2021-12-07 01:26:58,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:26:58,911 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 340 transitions. [2021-12-07 01:26:58,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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) [2021-12-07 01:26:58,911 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 340 transitions. [2021-12-07 01:26:58,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-07 01:26:58,911 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:26:58,911 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:26:58,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-07 01:26:58,912 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:26:58,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:26:58,912 INFO L85 PathProgramCache]: Analyzing trace with hash 74446604, now seen corresponding path program 1 times [2021-12-07 01:26:58,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:26:58,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067527375] [2021-12-07 01:26:58,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:26:58,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:26:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:26:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:26:58,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:26:58,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067527375] [2021-12-07 01:26:58,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067527375] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:26:58,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936276654] [2021-12-07 01:26:58,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:26:58,977 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:26:58,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:26:58,978 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:26:58,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-07 01:26:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:26:59,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-07 01:26:59,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:26:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:26:59,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:26:59,139 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:26:59,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936276654] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:26:59,140 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:26:59,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2021-12-07 01:26:59,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087288661] [2021-12-07 01:26:59,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:26:59,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 01:26:59,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:26:59,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 01:26:59,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:26:59,141 INFO L87 Difference]: Start difference. First operand 289 states and 340 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:26:59,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:26:59,253 INFO L93 Difference]: Finished difference Result 505 states and 575 transitions. [2021-12-07 01:26:59,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 01:26:59,253 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-07 01:26:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:26:59,255 INFO L225 Difference]: With dead ends: 505 [2021-12-07 01:26:59,255 INFO L226 Difference]: Without dead ends: 505 [2021-12-07 01:26:59,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2021-12-07 01:26:59,256 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 263 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:26:59,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 1612 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:26:59,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-12-07 01:26:59,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 323. [2021-12-07 01:26:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 295 states have (on average 1.311864406779661) internal successors, (387), 322 states have internal predecessors, (387), 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) [2021-12-07 01:26:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 387 transitions. [2021-12-07 01:26:59,262 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 387 transitions. Word has length 38 [2021-12-07 01:26:59,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:26:59,262 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 387 transitions. [2021-12-07 01:26:59,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:26:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 387 transitions. [2021-12-07 01:26:59,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-07 01:26:59,263 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:26:59,263 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:26:59,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-07 01:26:59,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:26:59,463 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:26:59,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:26:59,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1481327645, now seen corresponding path program 2 times [2021-12-07 01:26:59,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:26:59,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917319638] [2021-12-07 01:26:59,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:26:59,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:26:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:26:59,631 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-07 01:26:59,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:26:59,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917319638] [2021-12-07 01:26:59,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917319638] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:26:59,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867668157] [2021-12-07 01:26:59,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-07 01:26:59,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:26:59,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:26:59,632 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:26:59,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-07 01:26:59,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-07 01:26:59,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:26:59,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-07 01:26:59,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:26:59,891 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-07 01:26:59,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-07 01:26:59,898 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-07 01:26:59,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-07 01:26:59,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:26:59,981 INFO L388 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 [2021-12-07 01:26:59,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:26:59,984 INFO L388 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 [2021-12-07 01:27:00,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:27:00,030 INFO L388 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 [2021-12-07 01:27:00,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:27:00,034 INFO L388 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 [2021-12-07 01:27:00,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:27:00,093 INFO L388 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 [2021-12-07 01:27:00,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:27:00,096 INFO L388 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 [2021-12-07 01:27:00,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:27:00,144 INFO L388 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 [2021-12-07 01:27:00,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:27:00,150 INFO L388 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 [2021-12-07 01:27:00,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:27:00,167 INFO L388 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 [2021-12-07 01:27:00,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:27:00,171 INFO L388 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 [2021-12-07 01:27:00,236 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:27:00,240 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-07 01:27:00,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-07 01:27:00,243 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:27:00,246 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-07 01:27:00,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-07 01:27:00,284 INFO L388 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 [2021-12-07 01:27:00,285 INFO L388 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 [2021-12-07 01:27:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-07 01:27:00,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:27:02,304 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_sll_append_~new_last~0#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_sll_append_~new_last~0#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) is different from false [2021-12-07 01:27:04,312 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_sll_append_~new_last~0#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#res#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_sll_append_~new_last~0#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#res#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) is different from false [2021-12-07 01:27:06,320 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_sll_append_~new_last~0#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((|ULTIMATE.start_sll_append_~new_last~0#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) is different from false [2021-12-07 01:27:47,969 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset_16| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| Int) (|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| Int)) (or (< 0 |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset_16|) (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset_16| 0) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) (and (forall ((v_ArrVal_798 (Array Int Int)) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (|ULTIMATE.start_sll_append_~new_last~0#1.base| Int)) (= (select (select (let ((.cse0 (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 0)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_790) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_792) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_795) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_798))) (store .cse0 |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select .cse0 |ULTIMATE.start_sll_append_~new_last~0#1.base|) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset_16| 0))) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_799 (Array Int Int)) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (|ULTIMATE.start_sll_append_~new_last~0#1.base| Int)) (= (select (select (let ((.cse1 (store (store (store (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 0)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_791) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_793) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_794) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_799))) (store .cse1 |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select .cse1 |ULTIMATE.start_sll_append_~new_last~0#1.base|) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset_16| 0))) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36|))) is different from false [2021-12-07 01:27:52,600 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 20 refuted. 8 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:27:52,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867668157] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:27:52,600 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:27:52,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 19] total 37 [2021-12-07 01:27:52,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70374905] [2021-12-07 01:27:52,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:27:52,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-07 01:27:52,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:27:52,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-07 01:27:52,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=838, Unknown=64, NotChecked=260, Total=1332 [2021-12-07 01:27:52,602 INFO L87 Difference]: Start difference. First operand 323 states and 387 transitions. Second operand has 37 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:27:54,625 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset_16| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| Int) (|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| Int)) (or (< 0 |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset_16|) (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset_16| 0) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) (and (forall ((v_ArrVal_798 (Array Int Int)) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (|ULTIMATE.start_sll_append_~new_last~0#1.base| Int)) (= (select (select (let ((.cse0 (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 0)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_790) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_792) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_795) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_798))) (store .cse0 |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select .cse0 |ULTIMATE.start_sll_append_~new_last~0#1.base|) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset_16| 0))) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_799 (Array Int Int)) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (|ULTIMATE.start_sll_append_~new_last~0#1.base| Int)) (= (select (select (let ((.cse1 (store (store (store (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 0)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_791) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_793) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_794) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_799))) (store .cse1 |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select .cse1 |ULTIMATE.start_sll_append_~new_last~0#1.base|) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset_16| 0))) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|) (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) is different from false [2021-12-07 01:27:57,129 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (forall ((|ULTIMATE.start_sll_append_~new_last~0#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (= (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (<= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (forall ((|ULTIMATE.start_sll_append_~new_last~0#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= 0 (select .cse1 0)) (<= 0 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) (not (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select .cse0 0) 0))) is different from false [2021-12-07 01:27:59,134 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (forall ((|ULTIMATE.start_sll_append_~new_last~0#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#res#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (<= 0 |c_ULTIMATE.start_node_create_with_sublist_#res#1.offset|) (= (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= |c_ULTIMATE.start_node_create_with_sublist_#res#1.offset| 0) (forall ((|ULTIMATE.start_sll_append_~new_last~0#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) |c_ULTIMATE.start_node_create_with_sublist_#res#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= 0 (select .cse1 0)) (not (= |c_ULTIMATE.start_node_create_with_sublist_#res#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (= (select .cse0 0) 0))) is different from false [2021-12-07 01:28:01,139 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= 0 (select .cse1 0)) (forall ((|ULTIMATE.start_sll_append_~new_last~0#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (= (select .cse0 0) 0) (forall ((|ULTIMATE.start_sll_append_~new_last~0#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0)) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) is different from false [2021-12-07 01:28:01,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:28:01,535 INFO L93 Difference]: Finished difference Result 404 states and 474 transitions. [2021-12-07 01:28:01,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-07 01:28:01,536 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-07 01:28:01,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:28:01,538 INFO L225 Difference]: With dead ends: 404 [2021-12-07 01:28:01,538 INFO L226 Difference]: Without dead ends: 404 [2021-12-07 01:28:01,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 53.5s TimeCoverageRelationStatistics Valid=255, Invalid=1115, Unknown=68, NotChecked=632, Total=2070 [2021-12-07 01:28:01,539 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 46 mSDsluCounter, 1670 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 509 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-07 01:28:01,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 1759 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 282 Invalid, 0 Unknown, 509 Unchecked, 0.5s Time] [2021-12-07 01:28:01,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-12-07 01:28:01,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 393. [2021-12-07 01:28:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 365 states have (on average 1.2684931506849315) internal successors, (463), 392 states have internal predecessors, (463), 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) [2021-12-07 01:28:01,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 463 transitions. [2021-12-07 01:28:01,546 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 463 transitions. Word has length 42 [2021-12-07 01:28:01,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:28:01,546 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 463 transitions. [2021-12-07 01:28:01,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:28:01,547 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 463 transitions. [2021-12-07 01:28:01,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-07 01:28:01,547 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:28:01,547 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:28:01,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-07 01:28:01,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-07 01:28:01,748 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:28:01,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:28:01,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1784280353, now seen corresponding path program 1 times [2021-12-07 01:28:01,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:28:01,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359772464] [2021-12-07 01:28:01,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:28:01,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:28:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:28:01,781 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-07 01:28:01,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:28:01,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359772464] [2021-12-07 01:28:01,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359772464] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:28:01,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:28:01,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:28:01,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733189233] [2021-12-07 01:28:01,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:28:01,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:28:01,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:28:01,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:28:01,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:28:01,782 INFO L87 Difference]: Start difference. First operand 393 states and 463 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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) [2021-12-07 01:28:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:28:01,814 INFO L93 Difference]: Finished difference Result 497 states and 594 transitions. [2021-12-07 01:28:01,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:28:01,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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) Word has length 42 [2021-12-07 01:28:01,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:28:01,817 INFO L225 Difference]: With dead ends: 497 [2021-12-07 01:28:01,817 INFO L226 Difference]: Without dead ends: 497 [2021-12-07 01:28:01,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:28:01,817 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 104 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:28:01,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 348 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:28:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2021-12-07 01:28:01,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 325. [2021-12-07 01:28:01,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 297 states have (on average 1.292929292929293) internal successors, (384), 324 states have internal predecessors, (384), 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) [2021-12-07 01:28:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 384 transitions. [2021-12-07 01:28:01,824 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 384 transitions. Word has length 42 [2021-12-07 01:28:01,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:28:01,824 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 384 transitions. [2021-12-07 01:28:01,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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) [2021-12-07 01:28:01,824 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 384 transitions. [2021-12-07 01:28:01,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-07 01:28:01,824 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:28:01,824 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:28:01,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-07 01:28:01,825 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:28:01,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:28:01,825 INFO L85 PathProgramCache]: Analyzing trace with hash -563101512, now seen corresponding path program 1 times [2021-12-07 01:28:01,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:28:01,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336968683] [2021-12-07 01:28:01,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:28:01,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:28:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:28:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-07 01:28:01,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:28:01,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336968683] [2021-12-07 01:28:01,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336968683] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:28:01,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:28:01,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:28:01,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062404391] [2021-12-07 01:28:01,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:28:01,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:28:01,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:28:01,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:28:01,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:28:01,876 INFO L87 Difference]: Start difference. First operand 325 states and 384 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2021-12-07 01:28:01,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:28:01,958 INFO L93 Difference]: Finished difference Result 387 states and 442 transitions. [2021-12-07 01:28:01,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:28:01,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-12-07 01:28:01,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:28:01,960 INFO L225 Difference]: With dead ends: 387 [2021-12-07 01:28:01,960 INFO L226 Difference]: Without dead ends: 387 [2021-12-07 01:28:01,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:28:01,961 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 254 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:28:01,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 192 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:28:01,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-12-07 01:28:01,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 323. [2021-12-07 01:28:01,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 295 states have (on average 1.2881355932203389) internal successors, (380), 322 states have internal predecessors, (380), 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) [2021-12-07 01:28:01,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 380 transitions. [2021-12-07 01:28:01,966 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 380 transitions. Word has length 55 [2021-12-07 01:28:01,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:28:01,966 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 380 transitions. [2021-12-07 01:28:01,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2021-12-07 01:28:01,966 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 380 transitions. [2021-12-07 01:28:01,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-07 01:28:01,967 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:28:01,967 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:28:01,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-07 01:28:01,967 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:28:01,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:28:01,967 INFO L85 PathProgramCache]: Analyzing trace with hash -276278871, now seen corresponding path program 1 times [2021-12-07 01:28:01,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:28:01,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76694251] [2021-12-07 01:28:01,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:28:01,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:28:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:28:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-07 01:28:02,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:28:02,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76694251] [2021-12-07 01:28:02,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76694251] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:28:02,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:28:02,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:28:02,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781196472] [2021-12-07 01:28:02,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:28:02,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 01:28:02,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:28:02,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 01:28:02,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:28:02,149 INFO L87 Difference]: Start difference. First operand 323 states and 380 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 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) [2021-12-07 01:28:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:28:02,790 INFO L93 Difference]: Finished difference Result 541 states and 636 transitions. [2021-12-07 01:28:02,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 01:28:02,791 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 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 56 [2021-12-07 01:28:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:28:02,793 INFO L225 Difference]: With dead ends: 541 [2021-12-07 01:28:02,793 INFO L226 Difference]: Without dead ends: 541 [2021-12-07 01:28:02,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2021-12-07 01:28:02,794 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 804 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:28:02,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [804 Valid, 409 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:28:02,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2021-12-07 01:28:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 358. [2021-12-07 01:28:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 331 states have (on average 1.2870090634441087) internal successors, (426), 357 states have internal predecessors, (426), 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) [2021-12-07 01:28:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 426 transitions. [2021-12-07 01:28:02,800 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 426 transitions. Word has length 56 [2021-12-07 01:28:02,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:28:02,800 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 426 transitions. [2021-12-07 01:28:02,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 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) [2021-12-07 01:28:02,801 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 426 transitions. [2021-12-07 01:28:02,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-07 01:28:02,801 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:28:02,801 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:28:02,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-07 01:28:02,801 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:28:02,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:28:02,802 INFO L85 PathProgramCache]: Analyzing trace with hash -276278870, now seen corresponding path program 1 times [2021-12-07 01:28:02,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:28:02,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264074516] [2021-12-07 01:28:02,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:28:02,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:28:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:28:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-07 01:28:03,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:28:03,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264074516] [2021-12-07 01:28:03,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264074516] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:28:03,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:28:03,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:28:03,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946527151] [2021-12-07 01:28:03,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:28:03,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 01:28:03,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:28:03,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 01:28:03,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:28:03,061 INFO L87 Difference]: Start difference. First operand 358 states and 426 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 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) [2021-12-07 01:28:03,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:28:03,664 INFO L93 Difference]: Finished difference Result 522 states and 628 transitions. [2021-12-07 01:28:03,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 01:28:03,664 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 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 56 [2021-12-07 01:28:03,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:28:03,667 INFO L225 Difference]: With dead ends: 522 [2021-12-07 01:28:03,667 INFO L226 Difference]: Without dead ends: 522 [2021-12-07 01:28:03,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-12-07 01:28:03,667 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 1045 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:28:03,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1045 Valid, 341 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:28:03,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-12-07 01:28:03,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 391. [2021-12-07 01:28:03,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 364 states have (on average 1.3076923076923077) internal successors, (476), 390 states have internal predecessors, (476), 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) [2021-12-07 01:28:03,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 476 transitions. [2021-12-07 01:28:03,674 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 476 transitions. Word has length 56 [2021-12-07 01:28:03,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:28:03,674 INFO L470 AbstractCegarLoop]: Abstraction has 391 states and 476 transitions. [2021-12-07 01:28:03,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 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) [2021-12-07 01:28:03,674 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 476 transitions. [2021-12-07 01:28:03,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-07 01:28:03,677 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:28:03,677 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:28:03,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-07 01:28:03,678 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:28:03,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:28:03,678 INFO L85 PathProgramCache]: Analyzing trace with hash 25284007, now seen corresponding path program 1 times [2021-12-07 01:28:03,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:28:03,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606278869] [2021-12-07 01:28:03,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:28:03,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:28:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:28:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-07 01:28:03,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:28:03,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606278869] [2021-12-07 01:28:03,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606278869] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:28:03,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:28:03,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 01:28:03,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825256781] [2021-12-07 01:28:03,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:28:03,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 01:28:03,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:28:03,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 01:28:03,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:28:03,816 INFO L87 Difference]: Start difference. First operand 391 states and 476 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:28:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:28:04,133 INFO L93 Difference]: Finished difference Result 441 states and 544 transitions. [2021-12-07 01:28:04,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 01:28:04,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-12-07 01:28:04,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:28:04,136 INFO L225 Difference]: With dead ends: 441 [2021-12-07 01:28:04,136 INFO L226 Difference]: Without dead ends: 441 [2021-12-07 01:28:04,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:28:04,137 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 51 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:28:04,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 519 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:28:04,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2021-12-07 01:28:04,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 429. [2021-12-07 01:28:04,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 402 states have (on average 1.3333333333333333) internal successors, (536), 428 states have internal predecessors, (536), 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) [2021-12-07 01:28:04,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 536 transitions. [2021-12-07 01:28:04,144 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 536 transitions. Word has length 57 [2021-12-07 01:28:04,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:28:04,144 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 536 transitions. [2021-12-07 01:28:04,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:28:04,144 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 536 transitions. [2021-12-07 01:28:04,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-07 01:28:04,145 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:28:04,145 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:28:04,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-07 01:28:04,145 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:28:04,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:28:04,145 INFO L85 PathProgramCache]: Analyzing trace with hash 783803729, now seen corresponding path program 1 times [2021-12-07 01:28:04,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:28:04,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073161443] [2021-12-07 01:28:04,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:28:04,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:28:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:28:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-07 01:28:04,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:28:04,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073161443] [2021-12-07 01:28:04,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073161443] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:28:04,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:28:04,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:28:04,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65513135] [2021-12-07 01:28:04,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:28:04,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:28:04,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:28:04,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:28:04,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:28:04,305 INFO L87 Difference]: Start difference. First operand 429 states and 536 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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) [2021-12-07 01:28:04,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:28:04,672 INFO L93 Difference]: Finished difference Result 527 states and 649 transitions. [2021-12-07 01:28:04,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 01:28:04,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-12-07 01:28:04,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:28:04,675 INFO L225 Difference]: With dead ends: 527 [2021-12-07 01:28:04,675 INFO L226 Difference]: Without dead ends: 527 [2021-12-07 01:28:04,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-12-07 01:28:04,676 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 660 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:28:04,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [660 Valid, 408 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:28:04,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-12-07 01:28:04,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 429. [2021-12-07 01:28:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 402 states have (on average 1.3208955223880596) internal successors, (531), 428 states have internal predecessors, (531), 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) [2021-12-07 01:28:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 531 transitions. [2021-12-07 01:28:04,685 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 531 transitions. Word has length 58 [2021-12-07 01:28:04,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:28:04,685 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 531 transitions. [2021-12-07 01:28:04,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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) [2021-12-07 01:28:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 531 transitions. [2021-12-07 01:28:04,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-07 01:28:04,686 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:28:04,686 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:28:04,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-07 01:28:04,686 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:28:04,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:28:04,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1466385390, now seen corresponding path program 1 times [2021-12-07 01:28:04,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:28:04,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179633997] [2021-12-07 01:28:04,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:28:04,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:28:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:28:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-07 01:28:05,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:28:05,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179633997] [2021-12-07 01:28:05,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179633997] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:28:05,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204739336] [2021-12-07 01:28:05,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:28:05,323 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:28:05,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:28:05,324 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:28:05,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-07 01:28:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:28:05,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 78 conjunts are in the unsatisfiable core [2021-12-07 01:28:05,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:28:05,429 INFO L388 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 [2021-12-07 01:28:05,511 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:28:05,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:28:05,765 INFO L388 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 [2021-12-07 01:28:06,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-07 01:28:06,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:28:06,311 INFO L388 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 23 treesize of output 22 [2021-12-07 01:28:06,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-07 01:28:06,541 INFO L388 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 21 treesize of output 20 [2021-12-07 01:28:06,733 INFO L388 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 28 treesize of output 30 [2021-12-07 01:28:06,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-07 01:28:07,529 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:28:07,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:28:07,538 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-12-07 01:28:07,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 42 [2021-12-07 01:28:07,546 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-07 01:28:07,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2021-12-07 01:28:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-07 01:28:07,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:28:08,443 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:28:08,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1486 treesize of output 1469 [2021-12-07 01:28:45,257 INFO L354 Elim1Store]: treesize reduction 452, result has 46.3 percent of original size [2021-12-07 01:28:45,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 14 new quantified variables, introduced 78 case distinctions, treesize of input 50767 treesize of output 49115 [2021-12-07 01:28:48,172 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-07 01:28:48,173 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:28:48,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-12-07 01:28:48,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554920808] [2021-12-07 01:28:48,173 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-07 01:28:48,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-07 01:28:48,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:28:48,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-07 01:28:48,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1286, Unknown=0, NotChecked=0, Total=1406 [2021-12-07 01:28:48,174 INFO L87 Difference]: Start difference. First operand 429 states and 531 transitions. Second operand has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 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) [2021-12-07 01:28:50,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:28:50,706 INFO L93 Difference]: Finished difference Result 627 states and 761 transitions. [2021-12-07 01:28:50,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-07 01:28:50,706 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-12-07 01:28:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:28:50,709 INFO L225 Difference]: With dead ends: 627 [2021-12-07 01:28:50,709 INFO L226 Difference]: Without dead ends: 627 [2021-12-07 01:28:50,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=514, Invalid=2908, Unknown=0, NotChecked=0, Total=3422 [2021-12-07 01:28:50,711 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 1755 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1755 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:28:50,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1755 Valid, 762 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-07 01:28:50,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2021-12-07 01:28:50,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 428. [2021-12-07 01:28:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 403 states have (on average 1.315136476426799) internal successors, (530), 427 states have internal predecessors, (530), 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) [2021-12-07 01:28:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 530 transitions. [2021-12-07 01:28:50,718 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 530 transitions. Word has length 59 [2021-12-07 01:28:50,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:28:50,719 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 530 transitions. [2021-12-07 01:28:50,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 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) [2021-12-07 01:28:50,719 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 530 transitions. [2021-12-07 01:28:50,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-07 01:28:50,719 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:28:50,719 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:28:50,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-07 01:28:50,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:28:50,921 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:28:50,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:28:50,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1466385389, now seen corresponding path program 1 times [2021-12-07 01:28:50,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:28:50,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819749838] [2021-12-07 01:28:50,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:28:50,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:28:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:28:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-07 01:28:51,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:28:51,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819749838] [2021-12-07 01:28:51,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819749838] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:28:51,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879416729] [2021-12-07 01:28:51,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:28:51,755 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:28:51,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:28:51,755 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:28:51,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-07 01:28:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:28:51,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 91 conjunts are in the unsatisfiable core [2021-12-07 01:28:51,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:28:51,852 INFO L388 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 [2021-12-07 01:28:51,928 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:28:51,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:28:52,155 INFO L388 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 [2021-12-07 01:28:52,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-07 01:28:52,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-07 01:28:52,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:28:52,769 INFO L388 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 23 treesize of output 22 [2021-12-07 01:28:52,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:28:52,787 INFO L388 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 21 treesize of output 20 [2021-12-07 01:28:52,977 INFO L388 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 19 treesize of output 18 [2021-12-07 01:28:52,994 INFO L388 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 21 treesize of output 20 [2021-12-07 01:28:53,209 INFO L388 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 28 treesize of output 30 [2021-12-07 01:28:53,214 INFO L388 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 34 treesize of output 36 [2021-12-07 01:28:54,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:28:54,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:28:54,145 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-12-07 01:28:54,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 49 [2021-12-07 01:28:54,165 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-12-07 01:28:54,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 21 [2021-12-07 01:28:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-07 01:28:54,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:28:56,582 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:28:56,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 155403 treesize of output 148019 [2021-12-07 01:29:02,127 INFO L354 Elim1Store]: treesize reduction 839, result has 38.7 percent of original size [2021-12-07 01:29:02,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 17 new quantified variables, introduced 120 case distinctions, treesize of input 4633101 treesize of output 4214460 [2021-12-07 01:34:26,379 WARN L227 SmtUtils]: Spent 5.40m on a formula simplification. DAG size of input: 5287 DAG size of output: 5197 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-07 01:38:52,044 WARN L227 SmtUtils]: Spent 4.43m on a formula simplification. DAG size of input: 4924 DAG size of output: 4858 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-07 01:38:52,133 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-07 01:38:52,133 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:38:52,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-12-07 01:38:52,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100460378] [2021-12-07 01:38:52,133 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-07 01:38:52,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-07 01:38:52,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:38:52,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-07 01:38:52,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1595, Unknown=0, NotChecked=0, Total=1722 [2021-12-07 01:38:52,134 INFO L87 Difference]: Start difference. First operand 428 states and 530 transitions. Second operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:38:56,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:38:56,065 INFO L93 Difference]: Finished difference Result 681 states and 817 transitions. [2021-12-07 01:38:56,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-07 01:38:56,066 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-12-07 01:38:56,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:38:56,069 INFO L225 Difference]: With dead ends: 681 [2021-12-07 01:38:56,069 INFO L226 Difference]: Without dead ends: 681 [2021-12-07 01:38:56,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2021-12-07 01:38:56,071 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 2162 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2162 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:38:56,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2162 Valid, 628 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-07 01:38:56,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2021-12-07 01:38:56,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 428. [2021-12-07 01:38:56,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 403 states have (on average 1.3101736972704714) internal successors, (528), 427 states have internal predecessors, (528), 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) [2021-12-07 01:38:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 528 transitions. [2021-12-07 01:38:56,079 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 528 transitions. Word has length 59 [2021-12-07 01:38:56,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:38:56,079 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 528 transitions. [2021-12-07 01:38:56,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:38:56,079 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 528 transitions. [2021-12-07 01:38:56,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-07 01:38:56,080 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:38:56,080 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:38:56,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-07 01:38:56,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-12-07 01:38:56,281 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:38:56,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:38:56,283 INFO L85 PathProgramCache]: Analyzing trace with hash -974651946, now seen corresponding path program 1 times [2021-12-07 01:38:56,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:38:56,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029200669] [2021-12-07 01:38:56,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:38:56,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:38:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-07 01:38:57,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:38:57,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029200669] [2021-12-07 01:38:57,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029200669] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:38:57,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058558343] [2021-12-07 01:38:57,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:38:57,881 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:38:57,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:38:57,881 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:38:57,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-07 01:38:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:57,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 112 conjunts are in the unsatisfiable core [2021-12-07 01:38:57,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:38:58,004 INFO L388 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 [2021-12-07 01:38:58,141 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-07 01:38:58,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-07 01:38:58,383 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-07 01:38:58,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-07 01:38:58,554 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-07 01:38:58,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-07 01:38:58,947 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-12-07 01:38:58,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2021-12-07 01:38:59,190 INFO L388 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 11 treesize of output 7 [2021-12-07 01:39:00,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2021-12-07 01:39:00,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-07 01:39:00,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:39:00,319 INFO L388 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 21 treesize of output 20 [2021-12-07 01:39:00,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:39:00,364 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-07 01:39:00,365 INFO L388 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 52 [2021-12-07 01:39:00,810 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-07 01:39:00,811 INFO L388 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 50 [2021-12-07 01:39:00,850 INFO L388 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 19 treesize of output 18 [2021-12-07 01:39:01,331 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-07 01:39:01,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 60 [2021-12-07 01:39:01,340 INFO L388 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 34 treesize of output 36 [2021-12-07 01:39:03,372 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-12-07 01:39:03,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 34 [2021-12-07 01:39:04,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:39:04,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:39:04,051 INFO L354 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2021-12-07 01:39:04,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 154 treesize of output 59 [2021-12-07 01:39:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-07 01:39:04,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:39:07,271 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:39:07,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 38675 treesize of output 36437 [2021-12-07 01:39:07,736 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-07 01:39:07,736 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:39:07,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2021-12-07 01:39:07,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314799598] [2021-12-07 01:39:07,736 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-07 01:39:07,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-07 01:39:07,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:39:07,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-07 01:39:07,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2699, Unknown=0, NotChecked=0, Total=2862 [2021-12-07 01:39:07,738 INFO L87 Difference]: Start difference. First operand 428 states and 528 transitions. Second operand has 23 states, 22 states have (on average 2.409090909090909) internal successors, (53), 23 states have internal predecessors, (53), 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) [2021-12-07 01:39:14,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:39:14,053 INFO L93 Difference]: Finished difference Result 700 states and 847 transitions. [2021-12-07 01:39:14,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-07 01:39:14,054 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.409090909090909) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-07 01:39:14,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:39:14,057 INFO L225 Difference]: With dead ends: 700 [2021-12-07 01:39:14,057 INFO L226 Difference]: Without dead ends: 700 [2021-12-07 01:39:14,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=760, Invalid=6046, Unknown=0, NotChecked=0, Total=6806 [2021-12-07 01:39:14,059 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 2031 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2031 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:39:14,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2031 Valid, 1447 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1480 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-12-07 01:39:14,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2021-12-07 01:39:14,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 434. [2021-12-07 01:39:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 409 states have (on average 1.315403422982885) internal successors, (538), 433 states have internal predecessors, (538), 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) [2021-12-07 01:39:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 538 transitions. [2021-12-07 01:39:14,066 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 538 transitions. Word has length 62 [2021-12-07 01:39:14,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:39:14,066 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 538 transitions. [2021-12-07 01:39:14,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.409090909090909) internal successors, (53), 23 states have internal predecessors, (53), 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) [2021-12-07 01:39:14,067 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 538 transitions. [2021-12-07 01:39:14,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-07 01:39:14,067 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:39:14,067 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:39:14,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-07 01:39:14,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-12-07 01:39:14,268 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-07 01:39:14,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:39:14,270 INFO L85 PathProgramCache]: Analyzing trace with hash -974651945, now seen corresponding path program 1 times [2021-12-07 01:39:14,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:39:14,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979484722] [2021-12-07 01:39:14,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:39:14,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:39:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:39:16,321 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-07 01:39:16,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:39:16,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979484722] [2021-12-07 01:39:16,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979484722] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:39:16,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935535703] [2021-12-07 01:39:16,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:39:16,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:39:16,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:39:16,322 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:39:16,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e8bc4a-4e8a-4e99-9373-3b4ad22e49f5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-07 01:39:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:39:16,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 124 conjunts are in the unsatisfiable core [2021-12-07 01:39:16,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:39:16,451 INFO L388 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 [2021-12-07 01:39:16,574 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-07 01:39:16,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-07 01:39:16,800 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-12-07 01:39:16,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2021-12-07 01:39:17,012 INFO L388 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 [2021-12-07 01:39:17,095 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-07 01:39:17,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-07 01:39:17,557 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-12-07 01:39:17,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-12-07 01:39:17,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-07 01:39:17,819 INFO L388 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 11 treesize of output 7 [2021-12-07 01:39:17,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-07 01:39:18,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-07 01:39:18,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2021-12-07 01:39:19,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:39:19,055 INFO L388 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 34 treesize of output 36 [2021-12-07 01:39:19,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:39:19,077 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-07 01:39:19,077 INFO L388 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 59 [2021-12-07 01:39:19,574 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-07 01:39:19,574 INFO L388 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 57 [2021-12-07 01:39:19,582 INFO L388 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 30 treesize of output 32 [2021-12-07 01:39:20,120 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-07 01:39:20,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 67 [2021-12-07 01:39:20,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 54 [2021-12-07 01:39:23,091 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:39:23,123 INFO L354 Elim1Store]: treesize reduction 83, result has 11.7 percent of original size [2021-12-07 01:39:23,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 274 treesize of output 134 [2021-12-07 01:39:23,156 INFO L354 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2021-12-07 01:39:23,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 42 [2021-12-07 01:39:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-07 01:39:23,460 INFO L328 TraceCheckSpWp]: Computing backward predicates...