./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7e70badd Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-7e70bad [2021-11-23 12:36:05,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 12:36:05,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 12:36:05,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 12:36:05,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 12:36:05,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 12:36:05,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 12:36:05,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 12:36:05,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 12:36:05,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 12:36:05,285 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 12:36:05,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 12:36:05,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 12:36:05,291 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 12:36:05,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 12:36:05,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 12:36:05,303 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 12:36:05,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 12:36:05,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 12:36:05,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 12:36:05,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 12:36:05,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 12:36:05,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 12:36:05,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 12:36:05,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 12:36:05,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 12:36:05,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 12:36:05,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 12:36:05,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 12:36:05,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 12:36:05,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 12:36:05,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 12:36:05,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 12:36:05,351 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 12:36:05,353 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 12:36:05,354 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 12:36:05,355 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 12:36:05,355 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 12:36:05,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 12:36:05,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 12:36:05,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 12:36:05,359 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-23 12:36:05,416 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 12:36:05,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 12:36:05,417 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 12:36:05,417 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 12:36:05,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 12:36:05,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 12:36:05,427 INFO L138 SettingsManager]: * Use SBE=true [2021-11-23 12:36:05,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 12:36:05,428 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 12:36:05,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 12:36:05,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 12:36:05,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 12:36:05,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 12:36:05,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 12:36:05,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 12:36:05,431 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 12:36:05,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 12:36:05,432 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 12:36:05,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 12:36:05,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 12:36:05,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 12:36:05,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 12:36:05,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 12:36:05,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 12:36:05,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 12:36:05,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 12:36:05,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-23 12:36:05,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 12:36:05,435 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-23 12:36:05,435 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-23 12:36:05,435 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 12:36:05,436 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 12:36:05,436 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_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/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_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2021-11-23 12:36:05,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 12:36:05,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 12:36:05,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 12:36:05,842 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 12:36:05,843 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 12:36:05,845 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2021-11-23 12:36:05,916 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/data/c4633ee87/972bbfaf64dd49af9c1525d8f31093be/FLAGf1d5422ea [2021-11-23 12:36:06,573 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 12:36:06,574 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2021-11-23 12:36:06,592 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/data/c4633ee87/972bbfaf64dd49af9c1525d8f31093be/FLAGf1d5422ea [2021-11-23 12:36:06,796 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/data/c4633ee87/972bbfaf64dd49af9c1525d8f31093be [2021-11-23 12:36:06,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 12:36:06,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 12:36:06,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 12:36:06,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 12:36:06,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 12:36:06,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:36:06" (1/1) ... [2021-11-23 12:36:06,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62167a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:06, skipping insertion in model container [2021-11-23 12:36:06,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:36:06" (1/1) ... [2021-11-23 12:36:06,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 12:36:06,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 12:36:07,437 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_23008c1f-5e93-4c13-9018-685a1be849b9/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2021-11-23 12:36:07,500 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 12:36:07,509 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 12:36:07,575 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_23008c1f-5e93-4c13-9018-685a1be849b9/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2021-11-23 12:36:07,599 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 12:36:07,671 INFO L208 MainTranslator]: Completed translation [2021-11-23 12:36:07,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:07 WrapperNode [2021-11-23 12:36:07,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 12:36:07,673 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 12:36:07,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 12:36:07,673 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 12:36:07,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:07" (1/1) ... [2021-11-23 12:36:07,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:07" (1/1) ... [2021-11-23 12:36:07,756 INFO L137 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 33, calls inlined = 51, statements flattened = 548 [2021-11-23 12:36:07,757 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 12:36:07,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 12:36:07,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 12:36:07,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 12:36:07,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:07" (1/1) ... [2021-11-23 12:36:07,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:07" (1/1) ... [2021-11-23 12:36:07,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:07" (1/1) ... [2021-11-23 12:36:07,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:07" (1/1) ... [2021-11-23 12:36:07,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:07" (1/1) ... [2021-11-23 12:36:07,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:07" (1/1) ... [2021-11-23 12:36:07,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:07" (1/1) ... [2021-11-23 12:36:07,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 12:36:07,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 12:36:07,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 12:36:07,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 12:36:07,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:07" (1/1) ... [2021-11-23 12:36:07,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 12:36:07,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:36:07,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 12:36:07,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 12:36:08,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-23 12:36:08,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 12:36:08,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-23 12:36:08,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-23 12:36:08,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-23 12:36:08,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 12:36:08,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 12:36:08,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-23 12:36:08,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 12:36:08,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 12:36:08,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 12:36:08,162 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 12:36:08,164 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 12:36:09,017 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 12:36:09,031 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 12:36:09,031 INFO L301 CfgBuilder]: Removed 76 assume(true) statements. [2021-11-23 12:36:09,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:36:09 BoogieIcfgContainer [2021-11-23 12:36:09,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 12:36:09,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 12:36:09,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 12:36:09,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 12:36:09,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:36:06" (1/3) ... [2021-11-23 12:36:09,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249a7c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:36:09, skipping insertion in model container [2021-11-23 12:36:09,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:07" (2/3) ... [2021-11-23 12:36:09,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249a7c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:36:09, skipping insertion in model container [2021-11-23 12:36:09,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:36:09" (3/3) ... [2021-11-23 12:36:09,045 INFO L111 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2021-11-23 12:36:09,058 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 12:36:09,058 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2021-11-23 12:36:09,119 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 12:36:09,126 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 12:36:09,126 INFO L340 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2021-11-23 12:36:09,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 236 states, 201 states have (on average 1.756218905472637) internal successors, (353), 235 states have internal predecessors, (353), 0 states have call successors, (0), 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-11-23 12:36:09,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 12:36:09,159 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:36:09,159 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-23 12:36:09,160 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2021-11-23 12:36:09,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:36:09,167 INFO L85 PathProgramCache]: Analyzing trace with hash 890553479, now seen corresponding path program 1 times [2021-11-23 12:36:09,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:36:09,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717479356] [2021-11-23 12:36:09,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:36:09,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:36:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:36:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:36:09,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:36:09,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717479356] [2021-11-23 12:36:09,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717479356] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:36:09,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:36:09,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 12:36:09,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520704538] [2021-11-23 12:36:09,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:36:09,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-23 12:36:09,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:36:09,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-23 12:36:09,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-23 12:36:09,476 INFO L87 Difference]: Start difference. First operand has 236 states, 201 states have (on average 1.756218905472637) internal successors, (353), 235 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-11-23 12:36:09,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:36:09,551 INFO L93 Difference]: Finished difference Result 428 states and 662 transitions. [2021-11-23 12:36:09,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-23 12:36:09,554 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-11-23 12:36:09,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:36:09,570 INFO L225 Difference]: With dead ends: 428 [2021-11-23 12:36:09,571 INFO L226 Difference]: Without dead ends: 186 [2021-11-23 12:36:09,577 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-11-23 12:36:09,584 INFO L933 BasicCegarLoop]: 200 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, 200 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-11-23 12:36:09,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 12:36:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-11-23 12:36:09,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2021-11-23 12:36:09,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 156 states have (on average 1.2243589743589745) internal successors, (191), 185 states have internal predecessors, (191), 0 states have call successors, (0), 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-11-23 12:36:09,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 191 transitions. [2021-11-23 12:36:09,665 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 191 transitions. Word has length 6 [2021-11-23 12:36:09,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:36:09,666 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 191 transitions. [2021-11-23 12:36:09,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-11-23 12:36:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 191 transitions. [2021-11-23 12:36:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 12:36:09,668 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:36:09,668 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:36:09,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 12:36:09,670 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2021-11-23 12:36:09,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:36:09,675 INFO L85 PathProgramCache]: Analyzing trace with hash 779164181, now seen corresponding path program 1 times [2021-11-23 12:36:09,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:36:09,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680072964] [2021-11-23 12:36:09,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:36:09,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:36:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:36:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:36:09,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:36:09,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680072964] [2021-11-23 12:36:09,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680072964] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:36:09,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:36:09,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 12:36:09,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655823989] [2021-11-23 12:36:09,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:36:09,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 12:36:09,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:36:09,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 12:36:09,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 12:36:09,994 INFO L87 Difference]: Start difference. First operand 186 states and 191 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-11-23 12:36:10,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:36:10,281 INFO L93 Difference]: Finished difference Result 186 states and 191 transitions. [2021-11-23 12:36:10,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 12:36:10,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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 15 [2021-11-23 12:36:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:36:10,285 INFO L225 Difference]: With dead ends: 186 [2021-11-23 12:36:10,285 INFO L226 Difference]: Without dead ends: 182 [2021-11-23 12:36:10,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-23 12:36:10,299 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 197 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 12:36:10,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 279 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 12:36:10,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-11-23 12:36:10,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2021-11-23 12:36:10,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 154 states have (on average 1.2142857142857142) internal successors, (187), 181 states have internal predecessors, (187), 0 states have call successors, (0), 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-11-23 12:36:10,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 187 transitions. [2021-11-23 12:36:10,341 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 187 transitions. Word has length 15 [2021-11-23 12:36:10,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:36:10,345 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 187 transitions. [2021-11-23 12:36:10,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-11-23 12:36:10,350 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 187 transitions. [2021-11-23 12:36:10,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-23 12:36:10,351 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:36:10,351 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:36:10,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 12:36:10,353 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2021-11-23 12:36:10,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:36:10,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2083645996, now seen corresponding path program 1 times [2021-11-23 12:36:10,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:36:10,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233414106] [2021-11-23 12:36:10,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:36:10,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:36:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:36:10,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:36:10,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:36:10,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233414106] [2021-11-23 12:36:10,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233414106] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:36:10,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:36:10,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-23 12:36:10,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42268633] [2021-11-23 12:36:10,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:36:10,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 12:36:10,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:36:10,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 12:36:10,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-23 12:36:10,598 INFO L87 Difference]: Start difference. First operand 182 states and 187 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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-11-23 12:36:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:36:11,521 INFO L93 Difference]: Finished difference Result 272 states and 280 transitions. [2021-11-23 12:36:11,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 12:36:11,521 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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 18 [2021-11-23 12:36:11,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:36:11,524 INFO L225 Difference]: With dead ends: 272 [2021-11-23 12:36:11,524 INFO L226 Difference]: Without dead ends: 268 [2021-11-23 12:36:11,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-11-23 12:36:11,526 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 875 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-23 12:36:11,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [875 Valid, 497 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-23 12:36:11,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-11-23 12:36:11,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 195. [2021-11-23 12:36:11,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 168 states have (on average 1.2083333333333333) internal successors, (203), 194 states have internal predecessors, (203), 0 states have call successors, (0), 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-11-23 12:36:11,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 203 transitions. [2021-11-23 12:36:11,553 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 203 transitions. Word has length 18 [2021-11-23 12:36:11,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:36:11,553 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 203 transitions. [2021-11-23 12:36:11,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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-11-23 12:36:11,554 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 203 transitions. [2021-11-23 12:36:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-23 12:36:11,555 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:36:11,555 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:36:11,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 12:36:11,556 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2021-11-23 12:36:11,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:36:11,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1257643990, now seen corresponding path program 1 times [2021-11-23 12:36:11,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:36:11,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156160596] [2021-11-23 12:36:11,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:36:11,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:36:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:36:11,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:36:11,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:36:11,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156160596] [2021-11-23 12:36:11,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156160596] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:36:11,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:36:11,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-23 12:36:11,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874763136] [2021-11-23 12:36:11,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:36:11,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 12:36:11,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:36:11,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 12:36:11,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-23 12:36:11,883 INFO L87 Difference]: Start difference. First operand 195 states and 203 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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-11-23 12:36:12,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:36:12,567 INFO L93 Difference]: Finished difference Result 370 states and 383 transitions. [2021-11-23 12:36:12,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 12:36:12,568 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 21 [2021-11-23 12:36:12,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:36:12,571 INFO L225 Difference]: With dead ends: 370 [2021-11-23 12:36:12,571 INFO L226 Difference]: Without dead ends: 366 [2021-11-23 12:36:12,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-23 12:36:12,574 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 334 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-23 12:36:12,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 784 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-23 12:36:12,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-11-23 12:36:12,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 274. [2021-11-23 12:36:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 247 states have (on average 1.2105263157894737) internal successors, (299), 273 states have internal predecessors, (299), 0 states have call successors, (0), 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-11-23 12:36:12,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 299 transitions. [2021-11-23 12:36:12,596 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 299 transitions. Word has length 21 [2021-11-23 12:36:12,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:36:12,597 INFO L470 AbstractCegarLoop]: Abstraction has 274 states and 299 transitions. [2021-11-23 12:36:12,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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-11-23 12:36:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 299 transitions. [2021-11-23 12:36:12,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-23 12:36:12,598 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:36:12,599 INFO L514 BasicCegarLoop]: trace histogram [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-11-23 12:36:12,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 12:36:12,599 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2021-11-23 12:36:12,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:36:12,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1465545857, now seen corresponding path program 1 times [2021-11-23 12:36:12,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:36:12,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515570161] [2021-11-23 12:36:12,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:36:12,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:36:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:36:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:36:12,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:36:12,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515570161] [2021-11-23 12:36:12,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515570161] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:36:12,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:36:12,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-23 12:36:12,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266164659] [2021-11-23 12:36:12,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:36:12,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 12:36:12,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:36:12,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 12:36:12,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-23 12:36:12,887 INFO L87 Difference]: Start difference. First operand 274 states and 299 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:36:13,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:36:13,940 INFO L93 Difference]: Finished difference Result 366 states and 379 transitions. [2021-11-23 12:36:13,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 12:36:13,941 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-23 12:36:13,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:36:13,944 INFO L225 Difference]: With dead ends: 366 [2021-11-23 12:36:13,944 INFO L226 Difference]: Without dead ends: 362 [2021-11-23 12:36:13,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-11-23 12:36:13,946 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 281 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-23 12:36:13,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 870 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-23 12:36:13,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-11-23 12:36:13,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 277. [2021-11-23 12:36:13,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 250 states have (on average 1.204) internal successors, (301), 276 states have internal predecessors, (301), 0 states have call successors, (0), 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-11-23 12:36:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 301 transitions. [2021-11-23 12:36:13,969 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 301 transitions. Word has length 24 [2021-11-23 12:36:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:36:13,969 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 301 transitions. [2021-11-23 12:36:13,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:36:13,970 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 301 transitions. [2021-11-23 12:36:13,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-23 12:36:13,971 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:36:13,972 INFO L514 BasicCegarLoop]: trace histogram [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-11-23 12:36:13,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 12:36:13,972 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2021-11-23 12:36:13,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:36:13,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1727201086, now seen corresponding path program 1 times [2021-11-23 12:36:13,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:36:13,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820879416] [2021-11-23 12:36:13,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:36:13,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:36:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:36:14,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:36:14,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:36:14,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820879416] [2021-11-23 12:36:14,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820879416] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:36:14,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:36:14,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-23 12:36:14,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543449845] [2021-11-23 12:36:14,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:36:14,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-23 12:36:14,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:36:14,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-23 12:36:14,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-23 12:36:14,325 INFO L87 Difference]: Start difference. First operand 277 states and 301 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:36:16,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:36:16,331 INFO L93 Difference]: Finished difference Result 362 states and 375 transitions. [2021-11-23 12:36:16,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 12:36:16,332 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-23 12:36:16,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:36:16,335 INFO L225 Difference]: With dead ends: 362 [2021-11-23 12:36:16,335 INFO L226 Difference]: Without dead ends: 358 [2021-11-23 12:36:16,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2021-11-23 12:36:16,337 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 439 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-23 12:36:16,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [439 Valid, 976 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-23 12:36:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-11-23 12:36:16,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 280. [2021-11-23 12:36:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 253 states have (on average 1.1976284584980237) internal successors, (303), 279 states have internal predecessors, (303), 0 states have call successors, (0), 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-11-23 12:36:16,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 303 transitions. [2021-11-23 12:36:16,356 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 303 transitions. Word has length 27 [2021-11-23 12:36:16,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:36:16,358 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 303 transitions. [2021-11-23 12:36:16,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:36:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 303 transitions. [2021-11-23 12:36:16,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-23 12:36:16,360 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:36:16,360 INFO L514 BasicCegarLoop]: trace histogram [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-11-23 12:36:16,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 12:36:16,361 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2021-11-23 12:36:16,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:36:16,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1332465132, now seen corresponding path program 1 times [2021-11-23 12:36:16,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:36:16,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665640074] [2021-11-23 12:36:16,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:36:16,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:36:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:36:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:36:16,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:36:16,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665640074] [2021-11-23 12:36:16,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665640074] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:36:16,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:36:16,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 12:36:16,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187325690] [2021-11-23 12:36:16,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:36:16,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 12:36:16,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:36:16,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 12:36:16,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-23 12:36:16,808 INFO L87 Difference]: Start difference. First operand 280 states and 303 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 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-11-23 12:36:17,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:36:17,906 INFO L93 Difference]: Finished difference Result 358 states and 371 transitions. [2021-11-23 12:36:17,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 12:36:17,907 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 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 30 [2021-11-23 12:36:17,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:36:17,910 INFO L225 Difference]: With dead ends: 358 [2021-11-23 12:36:17,910 INFO L226 Difference]: Without dead ends: 354 [2021-11-23 12:36:17,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-11-23 12:36:17,912 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 400 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-23 12:36:17,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 830 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-23 12:36:17,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-11-23 12:36:17,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 283. [2021-11-23 12:36:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 256 states have (on average 1.19140625) internal successors, (305), 282 states have internal predecessors, (305), 0 states have call successors, (0), 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-11-23 12:36:17,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 305 transitions. [2021-11-23 12:36:17,944 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 305 transitions. Word has length 30 [2021-11-23 12:36:17,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:36:17,946 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 305 transitions. [2021-11-23 12:36:17,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 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-11-23 12:36:17,947 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 305 transitions. [2021-11-23 12:36:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-23 12:36:17,956 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:36:17,956 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:36:17,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 12:36:17,957 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2021-11-23 12:36:17,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:36:17,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1042625579, now seen corresponding path program 1 times [2021-11-23 12:36:17,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:36:17,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464391503] [2021-11-23 12:36:17,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:36:17,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:36:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:36:18,413 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:36:18,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:36:18,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464391503] [2021-11-23 12:36:18,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464391503] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:36:18,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704684319] [2021-11-23 12:36:18,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:36:18,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:36:18,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:36:18,417 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:36:18,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 12:36:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:36:18,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 100 conjunts are in the unsatisfiable core [2021-11-23 12:36:18,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:36:18,782 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 12:36:18,783 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-11-23 12:36:19,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:36:19,104 INFO L354 Elim1Store]: treesize reduction 263, result has 12.3 percent of original size [2021-11-23 12:36:19,105 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 227 treesize of output 81 [2021-11-23 12:36:19,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:36:19,138 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 64 treesize of output 56 [2021-11-23 12:36:19,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:36:19,541 INFO L354 Elim1Store]: treesize reduction 314, result has 16.9 percent of original size [2021-11-23 12:36:19,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 97 treesize of output 97 [2021-11-23 12:36:19,939 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-11-23 12:36:19,939 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 20 treesize of output 22 [2021-11-23 12:36:20,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:36:20,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:36:20,340 INFO L354 Elim1Store]: treesize reduction 781, result has 8.4 percent of original size [2021-11-23 12:36:20,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 245 treesize of output 108 [2021-11-23 12:36:22,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:36:22,682 INFO L354 Elim1Store]: treesize reduction 764, result has 10.6 percent of original size [2021-11-23 12:36:22,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 184 treesize of output 145 [2021-11-23 12:36:24,956 INFO L354 Elim1Store]: treesize reduction 374, result has 6.0 percent of original size [2021-11-23 12:36:24,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 155 treesize of output 78 [2021-11-23 12:36:25,043 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:36:25,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:36:27,276 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start___list_add_~new#1.offset_5| Int) (|v_ULTIMATE.start___list_add_~next#1.offset_5| Int) (|ULTIMATE.start_gl_insert_~node~1#1.offset| Int) (v_DerPreprocessor_4 Int)) (not (= |c_~#gl_list~0.base| (select (select (let ((.cse0 (let ((.cse1 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |ULTIMATE.start_gl_insert_~node~1#1.offset| v_DerPreprocessor_4)))) (let ((.cse3 (select (select .cse4 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse2 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ |v_ULTIMATE.start___list_add_~next#1.offset_5| 4) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store .cse2 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse2 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |v_ULTIMATE.start___list_add_~new#1.offset_5| .cse3) (+ |v_ULTIMATE.start___list_add_~new#1.offset_5| 4) |c_~#gl_list~0.base|))))))) (store .cse1 |c_~#gl_list~0.base| (store (select .cse1 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))))) (store .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (+ 12 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (+ 16 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) |c_~#gl_list~0.base|) (+ 4 |c_~#gl_list~0.offset|))))) is different from false [2021-11-23 12:36:36,881 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start___list_add_~new#1.offset_5| Int) (|v_ULTIMATE.start___list_add_~new#1.offset_6| Int) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_7| Int) (|v_ULTIMATE.start_gl_insert_~node~1#1.offset_9| Int) (|v_ULTIMATE.start___list_add_~next#1.offset_5| Int) (v_DerPreprocessor_6 Int) (|ULTIMATE.start_gl_insert_~node~1#1.offset| Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|) 0)) (not (= |c_~#gl_list~0.base| (select (select (let ((.cse0 (let ((.cse1 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |ULTIMATE.start_gl_insert_~node~1#1.offset| v_DerPreprocessor_5)))) (let ((.cse9 (select (select .cse10 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse8 (store .cse10 .cse9 (store (select .cse10 .cse9) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |ULTIMATE.start_gl_insert_~node~1#1.offset| v_DerPreprocessor_6)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) 4) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store .cse8 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse8 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |v_ULTIMATE.start___list_add_~new#1.offset_6| .cse9) (+ |v_ULTIMATE.start___list_add_~new#1.offset_6| 4) |c_~#gl_list~0.base|))))))) (store .cse7 |c_~#gl_list~0.base| (store (select .cse7 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))))) (store .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (+ 12 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (+ 16 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))))) (store .cse5 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7| (store (select .cse5 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|) |v_ULTIMATE.start_gl_insert_~node~1#1.offset_9| v_DerPreprocessor_4))))) (let ((.cse3 (select (select .cse4 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse2 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ |v_ULTIMATE.start___list_add_~next#1.offset_5| 4) |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|)))) (store .cse2 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7| (store (store (select .cse2 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|) |v_ULTIMATE.start___list_add_~new#1.offset_5| .cse3) (+ |v_ULTIMATE.start___list_add_~new#1.offset_5| 4) |c_~#gl_list~0.base|))))))) (store .cse1 |c_~#gl_list~0.base| (store (select .cse1 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|))))) (store .cse0 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7| (store (store (select .cse0 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|) (+ 12 |v_ULTIMATE.start_gl_insert_~node~1#1.offset_9|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|) (+ 16 |v_ULTIMATE.start_gl_insert_~node~1#1.offset_9|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|))) |c_~#gl_list~0.base|) (+ 4 |c_~#gl_list~0.offset|)))))) is different from false [2021-11-23 12:36:58,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_gl_insert_~node~1#1.base_8| Int) (|v_ULTIMATE.start___list_add_~new#1.offset_5| Int) (|v_ULTIMATE.start___list_add_~new#1.offset_6| Int) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_7| Int) (|v_ULTIMATE.start_gl_insert_~node~1#1.offset_9| Int) (|v_ULTIMATE.start___list_add_~next#1.offset_5| Int) (v_DerPreprocessor_6 Int) (|ULTIMATE.start_gl_insert_~node~1#1.offset| Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_8|) 0)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_8| 1) |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|) 0)) (not (= |c_~#gl_list~0.base| (select (select (let ((.cse0 (let ((.cse1 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_gl_insert_~node~1#1.base_8| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_gl_insert_~node~1#1.base_8|) |ULTIMATE.start_gl_insert_~node~1#1.offset| v_DerPreprocessor_5)))) (let ((.cse9 (select (select .cse10 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse8 (store .cse10 .cse9 (store (select .cse10 .cse9) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_8| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_8|) |ULTIMATE.start_gl_insert_~node~1#1.offset| v_DerPreprocessor_6)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) 4) |v_ULTIMATE.start_gl_insert_~node~1#1.base_8|)))) (store .cse8 |v_ULTIMATE.start_gl_insert_~node~1#1.base_8| (store (store (select .cse8 |v_ULTIMATE.start_gl_insert_~node~1#1.base_8|) |v_ULTIMATE.start___list_add_~new#1.offset_6| .cse9) (+ |v_ULTIMATE.start___list_add_~new#1.offset_6| 4) |c_~#gl_list~0.base|))))))) (store .cse7 |c_~#gl_list~0.base| (store (select .cse7 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_8|))))) (store .cse6 |v_ULTIMATE.start_gl_insert_~node~1#1.base_8| (store (store (select .cse6 |v_ULTIMATE.start_gl_insert_~node~1#1.base_8|) (+ 12 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_8|) (+ 16 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_8|))))) (store .cse5 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7| (store (select .cse5 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|) |v_ULTIMATE.start_gl_insert_~node~1#1.offset_9| v_DerPreprocessor_4))))) (let ((.cse3 (select (select .cse4 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse2 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ |v_ULTIMATE.start___list_add_~next#1.offset_5| 4) |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|)))) (store .cse2 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7| (store (store (select .cse2 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|) |v_ULTIMATE.start___list_add_~new#1.offset_5| .cse3) (+ |v_ULTIMATE.start___list_add_~new#1.offset_5| 4) |c_~#gl_list~0.base|))))))) (store .cse1 |c_~#gl_list~0.base| (store (select .cse1 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|))))) (store .cse0 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7| (store (store (select .cse0 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|) (+ 12 |v_ULTIMATE.start_gl_insert_~node~1#1.offset_9|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|) (+ 16 |v_ULTIMATE.start_gl_insert_~node~1#1.offset_9|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|))) |c_~#gl_list~0.base|) (+ 4 |c_~#gl_list~0.offset|)))))) is different from false [2021-11-23 12:37:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-23 12:37:00,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704684319] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:37:00,895 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:37:00,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2021-11-23 12:37:00,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196274264] [2021-11-23 12:37:00,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:37:00,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-23 12:37:00,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:37:00,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-23 12:37:00,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=532, Unknown=4, NotChecked=144, Total=756 [2021-11-23 12:37:00,898 INFO L87 Difference]: Start difference. First operand 283 states and 305 transitions. Second operand has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 27 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:37:18,116 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#gl_list~0.base| 3) (forall ((|v_ULTIMATE.start_gl_insert_~node~1#1.base_8| Int) (|v_ULTIMATE.start___list_add_~new#1.offset_5| Int) (|v_ULTIMATE.start___list_add_~new#1.offset_6| Int) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_7| Int) (|v_ULTIMATE.start_gl_insert_~node~1#1.offset_9| Int) (|v_ULTIMATE.start___list_add_~next#1.offset_5| Int) (v_DerPreprocessor_6 Int) (|ULTIMATE.start_gl_insert_~node~1#1.offset| Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_8|) 0)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_8| 1) |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|) 0)) (not (= |c_~#gl_list~0.base| (select (select (let ((.cse0 (let ((.cse1 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_gl_insert_~node~1#1.base_8| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_gl_insert_~node~1#1.base_8|) |ULTIMATE.start_gl_insert_~node~1#1.offset| v_DerPreprocessor_5)))) (let ((.cse9 (select (select .cse10 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse8 (store .cse10 .cse9 (store (select .cse10 .cse9) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_8| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_8|) |ULTIMATE.start_gl_insert_~node~1#1.offset| v_DerPreprocessor_6)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) 4) |v_ULTIMATE.start_gl_insert_~node~1#1.base_8|)))) (store .cse8 |v_ULTIMATE.start_gl_insert_~node~1#1.base_8| (store (store (select .cse8 |v_ULTIMATE.start_gl_insert_~node~1#1.base_8|) |v_ULTIMATE.start___list_add_~new#1.offset_6| .cse9) (+ |v_ULTIMATE.start___list_add_~new#1.offset_6| 4) |c_~#gl_list~0.base|))))))) (store .cse7 |c_~#gl_list~0.base| (store (select .cse7 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_8|))))) (store .cse6 |v_ULTIMATE.start_gl_insert_~node~1#1.base_8| (store (store (select .cse6 |v_ULTIMATE.start_gl_insert_~node~1#1.base_8|) (+ 12 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_8|) (+ 16 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_8|))))) (store .cse5 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7| (store (select .cse5 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|) |v_ULTIMATE.start_gl_insert_~node~1#1.offset_9| v_DerPreprocessor_4))))) (let ((.cse3 (select (select .cse4 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse2 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ |v_ULTIMATE.start___list_add_~next#1.offset_5| 4) |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|)))) (store .cse2 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7| (store (store (select .cse2 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|) |v_ULTIMATE.start___list_add_~new#1.offset_5| .cse3) (+ |v_ULTIMATE.start___list_add_~new#1.offset_5| 4) |c_~#gl_list~0.base|))))))) (store .cse1 |c_~#gl_list~0.base| (store (select .cse1 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|))))) (store .cse0 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7| (store (store (select .cse0 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|) (+ 12 |v_ULTIMATE.start_gl_insert_~node~1#1.offset_9|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|) (+ 16 |v_ULTIMATE.start_gl_insert_~node~1#1.offset_9|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|))) |c_~#gl_list~0.base|) (+ 4 |c_~#gl_list~0.offset|)))))) (= (select |c_#valid| 3) 1) (= |c_~#gl_list~0.offset| (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (= |c_~#gl_list~0.base| (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (<= 0 |c_~#gl_list~0.offset|) (<= |c_~#gl_list~0.offset| 0)) is different from false [2021-11-23 12:37:22,906 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| 3)) (= |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 0) (= |c_~#gl_list~0.base| 3) (forall ((|v_ULTIMATE.start___list_add_~new#1.offset_5| Int) (|v_ULTIMATE.start___list_add_~new#1.offset_6| Int) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_7| Int) (|v_ULTIMATE.start_gl_insert_~node~1#1.offset_9| Int) (|v_ULTIMATE.start___list_add_~next#1.offset_5| Int) (v_DerPreprocessor_6 Int) (|ULTIMATE.start_gl_insert_~node~1#1.offset| Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|) 0)) (not (= |c_~#gl_list~0.base| (select (select (let ((.cse0 (let ((.cse1 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |ULTIMATE.start_gl_insert_~node~1#1.offset| v_DerPreprocessor_5)))) (let ((.cse9 (select (select .cse10 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse8 (store .cse10 .cse9 (store (select .cse10 .cse9) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |ULTIMATE.start_gl_insert_~node~1#1.offset| v_DerPreprocessor_6)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) 4) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store .cse8 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse8 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |v_ULTIMATE.start___list_add_~new#1.offset_6| .cse9) (+ |v_ULTIMATE.start___list_add_~new#1.offset_6| 4) |c_~#gl_list~0.base|))))))) (store .cse7 |c_~#gl_list~0.base| (store (select .cse7 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))))) (store .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (+ 12 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (+ 16 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))))) (store .cse5 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7| (store (select .cse5 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|) |v_ULTIMATE.start_gl_insert_~node~1#1.offset_9| v_DerPreprocessor_4))))) (let ((.cse3 (select (select .cse4 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse2 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ |v_ULTIMATE.start___list_add_~next#1.offset_5| 4) |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|)))) (store .cse2 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7| (store (store (select .cse2 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|) |v_ULTIMATE.start___list_add_~new#1.offset_5| .cse3) (+ |v_ULTIMATE.start___list_add_~new#1.offset_5| 4) |c_~#gl_list~0.base|))))))) (store .cse1 |c_~#gl_list~0.base| (store (select .cse1 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|))))) (store .cse0 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7| (store (store (select .cse0 |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|) (+ 12 |v_ULTIMATE.start_gl_insert_~node~1#1.offset_9|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|) (+ 16 |v_ULTIMATE.start_gl_insert_~node~1#1.offset_9|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_7|))) |c_~#gl_list~0.base|) (+ 4 |c_~#gl_list~0.offset|)))))) (= (select |c_#valid| 3) 1) (= |c_~#gl_list~0.offset| (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (= |c_~#gl_list~0.base| (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (<= 0 |c_~#gl_list~0.offset|) (not (= |c_~#gl_list~0.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 1) (<= |c_~#gl_list~0.offset| 0)) is different from false [2021-11-23 12:37:26,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:37:26,721 INFO L93 Difference]: Finished difference Result 308 states and 331 transitions. [2021-11-23 12:37:26,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-23 12:37:26,722 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 27 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-23 12:37:26,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:37:26,725 INFO L225 Difference]: With dead ends: 308 [2021-11-23 12:37:26,725 INFO L226 Difference]: Without dead ends: 306 [2021-11-23 12:37:26,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 53.1s TimeCoverageRelationStatistics Valid=148, Invalid=988, Unknown=6, NotChecked=340, Total=1482 [2021-11-23 12:37:26,727 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 25 mSDsluCounter, 3061 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3245 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 469 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 12:37:26,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 3245 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 547 Invalid, 0 Unknown, 469 Unchecked, 0.5s Time] [2021-11-23 12:37:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-11-23 12:37:26,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2021-11-23 12:37:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 274 states have (on average 1.1824817518248176) internal successors, (324), 300 states have internal predecessors, (324), 0 states have call successors, (0), 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-11-23 12:37:26,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 324 transitions. [2021-11-23 12:37:26,754 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 324 transitions. Word has length 31 [2021-11-23 12:37:26,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:37:26,755 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 324 transitions. [2021-11-23 12:37:26,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 27 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:37:26,755 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 324 transitions. [2021-11-23 12:37:26,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-23 12:37:26,758 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:37:26,758 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1] [2021-11-23 12:37:26,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-23 12:37:26,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-23 12:37:26,983 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2021-11-23 12:37:26,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:37:26,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1374097003, now seen corresponding path program 1 times [2021-11-23 12:37:26,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:37:26,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027162894] [2021-11-23 12:37:26,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:37:26,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:37:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:37:27,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:37:27,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:37:27,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027162894] [2021-11-23 12:37:27,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027162894] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:37:27,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:37:27,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 12:37:27,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679840233] [2021-11-23 12:37:27,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:37:27,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 12:37:27,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:37:27,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 12:37:27,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-23 12:37:27,331 INFO L87 Difference]: Start difference. First operand 301 states and 324 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:37:28,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:37:28,565 INFO L93 Difference]: Finished difference Result 369 states and 383 transitions. [2021-11-23 12:37:28,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-23 12:37:28,566 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-23 12:37:28,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:37:28,569 INFO L225 Difference]: With dead ends: 369 [2021-11-23 12:37:28,569 INFO L226 Difference]: Without dead ends: 365 [2021-11-23 12:37:28,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-11-23 12:37:28,571 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 667 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-23 12:37:28,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [667 Valid, 573 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-23 12:37:28,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-11-23 12:37:28,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 304. [2021-11-23 12:37:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 277 states have (on average 1.1768953068592058) internal successors, (326), 303 states have internal predecessors, (326), 0 states have call successors, (0), 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-11-23 12:37:28,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 326 transitions. [2021-11-23 12:37:28,613 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 326 transitions. Word has length 33 [2021-11-23 12:37:28,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:37:28,615 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 326 transitions. [2021-11-23 12:37:28,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:37:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 326 transitions. [2021-11-23 12:37:28,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 12:37:28,619 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:37:28,620 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:37:28,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-23 12:37:28,620 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2021-11-23 12:37:28,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:37:28,621 INFO L85 PathProgramCache]: Analyzing trace with hash 351697908, now seen corresponding path program 1 times [2021-11-23 12:37:28,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:37:28,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985308684] [2021-11-23 12:37:28,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:37:28,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:37:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:37:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:37:29,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:37:29,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985308684] [2021-11-23 12:37:29,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985308684] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:37:29,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355569124] [2021-11-23 12:37:29,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:37:29,202 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:37:29,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:37:29,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:37:29,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 12:37:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:37:29,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 100 conjunts are in the unsatisfiable core [2021-11-23 12:37:29,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:37:29,406 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 12:37:29,406 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 21 [2021-11-23 12:37:29,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:37:29,639 INFO L354 Elim1Store]: treesize reduction 263, result has 12.3 percent of original size [2021-11-23 12:37:29,639 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 227 treesize of output 81 [2021-11-23 12:37:29,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:37:29,656 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 64 treesize of output 56 [2021-11-23 12:37:29,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:37:29,982 INFO L354 Elim1Store]: treesize reduction 314, result has 16.9 percent of original size [2021-11-23 12:37:29,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 105 treesize of output 101 [2021-11-23 12:37:30,321 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-11-23 12:37:30,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2021-11-23 12:37:30,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:37:30,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:37:30,714 INFO L354 Elim1Store]: treesize reduction 843, result has 9.5 percent of original size [2021-11-23 12:37:30,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 253 treesize of output 129 [2021-11-23 12:37:44,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:37:44,925 INFO L354 Elim1Store]: treesize reduction 914, result has 9.7 percent of original size [2021-11-23 12:37:44,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 229 treesize of output 173 [2021-11-23 12:38:11,695 INFO L354 Elim1Store]: treesize reduction 408, result has 63.7 percent of original size [2021-11-23 12:38:11,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 1 disjoint index pairs (out of 78 index pairs), introduced 17 new quantified variables, introduced 77 case distinctions, treesize of input 392 treesize of output 836 [2021-11-23 12:42:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:42:02,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:42:04,520 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start___list_add_~prev#1.offset_7| Int) (|v_ULTIMATE.start___list_add_~next#1.offset_7| Int) (|v_ULTIMATE.start___list_add_~new#1.offset_7| Int) (|ULTIMATE.start_gl_insert_~node~1#1.offset| Int) (v_DerPreprocessor_10 Int)) (not (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |ULTIMATE.start_gl_insert_~node~1#1.offset| v_DerPreprocessor_10)))) (let ((.cse3 (select (select .cse4 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse2 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ |v_ULTIMATE.start___list_add_~next#1.offset_7| 4) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store .cse2 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse2 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |v_ULTIMATE.start___list_add_~new#1.offset_7| .cse3) (+ |v_ULTIMATE.start___list_add_~new#1.offset_7| 4) |c_~#gl_list~0.base|))))))) (store .cse1 |c_~#gl_list~0.base| (store (select .cse1 |c_~#gl_list~0.base|) |v_ULTIMATE.start___list_add_~prev#1.offset_7| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))))) (store .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (+ 12 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (+ 16 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) |c_~#gl_list~0.base|) (+ 4 |c_~#gl_list~0.offset|)) 0))) is different from false [2021-11-23 12:42:30,111 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start___list_add_~new#1.offset_8| Int) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_9| Int) (v_DerPreprocessor_11 Int) (|v_ULTIMATE.start___list_add_~prev#1.offset_7| Int) (v_DerPreprocessor_12 Int) (|v_ULTIMATE.start___list_add_~next#1.offset_7| Int) (|v_ULTIMATE.start___list_add_~new#1.offset_7| Int) (|v_ULTIMATE.start_gl_insert_~node~1#1.offset_13| Int) (|ULTIMATE.start_gl_insert_~node~1#1.offset| Int) (v_DerPreprocessor_10 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|) 0)) (= |v_ULTIMATE.start_gl_insert_~node~1#1.base_9| 0) (not (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |ULTIMATE.start_gl_insert_~node~1#1.offset| v_DerPreprocessor_11)))) (let ((.cse9 (select (select .cse10 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse8 (store .cse10 .cse9 (store (select .cse10 .cse9) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |ULTIMATE.start_gl_insert_~node~1#1.offset| v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store .cse8 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse8 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |v_ULTIMATE.start___list_add_~new#1.offset_8| .cse9) (+ |v_ULTIMATE.start___list_add_~new#1.offset_8| 4) |c_~#gl_list~0.base|))))))) (store .cse7 |c_~#gl_list~0.base| (store (select .cse7 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))))) (store .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (+ 12 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (+ 16 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))))) (store .cse5 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9| (store (select .cse5 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|) |v_ULTIMATE.start_gl_insert_~node~1#1.offset_13| v_DerPreprocessor_10))))) (let ((.cse3 (select (select .cse4 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse2 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ |v_ULTIMATE.start___list_add_~next#1.offset_7| 4) |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|)))) (store .cse2 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9| (store (store (select .cse2 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|) |v_ULTIMATE.start___list_add_~new#1.offset_7| .cse3) (+ |v_ULTIMATE.start___list_add_~new#1.offset_7| 4) |c_~#gl_list~0.base|))))))) (store .cse1 |c_~#gl_list~0.base| (store (select .cse1 |c_~#gl_list~0.base|) |v_ULTIMATE.start___list_add_~prev#1.offset_7| |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|))))) (store .cse0 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9| (store (store (select .cse0 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|) (+ 12 |v_ULTIMATE.start_gl_insert_~node~1#1.offset_13|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|) (+ 16 |v_ULTIMATE.start_gl_insert_~node~1#1.offset_13|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|))) |c_~#gl_list~0.base|) (+ 4 |c_~#gl_list~0.offset|)) 0)))) is different from false [2021-11-23 12:43:50,255 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start___list_add_~new#1.offset_8| Int) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_9| Int) (v_DerPreprocessor_11 Int) (|v_ULTIMATE.start___list_add_~prev#1.offset_7| Int) (v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_10| Int) (|v_ULTIMATE.start___list_add_~next#1.offset_7| Int) (|v_ULTIMATE.start___list_add_~new#1.offset_7| Int) (|v_ULTIMATE.start_gl_insert_~node~1#1.offset_13| Int) (|ULTIMATE.start_gl_insert_~node~1#1.offset| Int) (v_DerPreprocessor_10 Int)) (or (not (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_gl_insert_~node~1#1.base_10| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_gl_insert_~node~1#1.base_10|) |ULTIMATE.start_gl_insert_~node~1#1.offset| v_DerPreprocessor_11)))) (let ((.cse9 (select (select .cse10 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse8 (store .cse10 .cse9 (store (select .cse10 .cse9) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_10| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_10|) |ULTIMATE.start_gl_insert_~node~1#1.offset| v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) 4) |v_ULTIMATE.start_gl_insert_~node~1#1.base_10|)))) (store .cse8 |v_ULTIMATE.start_gl_insert_~node~1#1.base_10| (store (store (select .cse8 |v_ULTIMATE.start_gl_insert_~node~1#1.base_10|) |v_ULTIMATE.start___list_add_~new#1.offset_8| .cse9) (+ |v_ULTIMATE.start___list_add_~new#1.offset_8| 4) |c_~#gl_list~0.base|))))))) (store .cse7 |c_~#gl_list~0.base| (store (select .cse7 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_10|))))) (store .cse6 |v_ULTIMATE.start_gl_insert_~node~1#1.base_10| (store (store (select .cse6 |v_ULTIMATE.start_gl_insert_~node~1#1.base_10|) (+ 12 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_10|) (+ 16 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_10|))))) (store .cse5 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9| (store (select .cse5 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|) |v_ULTIMATE.start_gl_insert_~node~1#1.offset_13| v_DerPreprocessor_10))))) (let ((.cse3 (select (select .cse4 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse2 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ |v_ULTIMATE.start___list_add_~next#1.offset_7| 4) |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|)))) (store .cse2 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9| (store (store (select .cse2 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|) |v_ULTIMATE.start___list_add_~new#1.offset_7| .cse3) (+ |v_ULTIMATE.start___list_add_~new#1.offset_7| 4) |c_~#gl_list~0.base|))))))) (store .cse1 |c_~#gl_list~0.base| (store (select .cse1 |c_~#gl_list~0.base|) |v_ULTIMATE.start___list_add_~prev#1.offset_7| |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|))))) (store .cse0 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9| (store (store (select .cse0 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|) (+ 12 |v_ULTIMATE.start_gl_insert_~node~1#1.offset_13|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|) (+ 16 |v_ULTIMATE.start_gl_insert_~node~1#1.offset_13|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|))) |c_~#gl_list~0.base|) (+ 4 |c_~#gl_list~0.offset|)) 0)) (= |v_ULTIMATE.start_gl_insert_~node~1#1.base_9| 0) (= |v_ULTIMATE.start_gl_insert_~node~1#1.base_10| 0) (not (= (select (store |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_10| 1) |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_10|) 0)))) is different from false [2021-11-23 12:43:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-23 12:43:57,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355569124] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:43:57,188 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:43:57,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2021-11-23 12:43:57,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843490222] [2021-11-23 12:43:57,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:43:57,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-23 12:43:57,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:43:57,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-23 12:43:57,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=606, Unknown=6, NotChecked=156, Total=870 [2021-11-23 12:43:57,191 INFO L87 Difference]: Start difference. First operand 304 states and 326 transitions. Second operand has 30 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 29 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:45:06,396 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|))) (and (forall ((|v_ULTIMATE.start___list_add_~new#1.offset_8| Int) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_9| Int) (v_DerPreprocessor_11 Int) (|v_ULTIMATE.start___list_add_~prev#1.offset_7| Int) (v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_10| Int) (|v_ULTIMATE.start___list_add_~next#1.offset_7| Int) (|v_ULTIMATE.start___list_add_~new#1.offset_7| Int) (|v_ULTIMATE.start_gl_insert_~node~1#1.offset_13| Int) (|ULTIMATE.start_gl_insert_~node~1#1.offset| Int) (v_DerPreprocessor_10 Int)) (or (not (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_gl_insert_~node~1#1.base_10| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_gl_insert_~node~1#1.base_10|) |ULTIMATE.start_gl_insert_~node~1#1.offset| v_DerPreprocessor_11)))) (let ((.cse9 (select (select .cse10 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse8 (store .cse10 .cse9 (store (select .cse10 .cse9) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_10| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_10|) |ULTIMATE.start_gl_insert_~node~1#1.offset| v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) 4) |v_ULTIMATE.start_gl_insert_~node~1#1.base_10|)))) (store .cse8 |v_ULTIMATE.start_gl_insert_~node~1#1.base_10| (store (store (select .cse8 |v_ULTIMATE.start_gl_insert_~node~1#1.base_10|) |v_ULTIMATE.start___list_add_~new#1.offset_8| .cse9) (+ |v_ULTIMATE.start___list_add_~new#1.offset_8| 4) |c_~#gl_list~0.base|))))))) (store .cse7 |c_~#gl_list~0.base| (store (select .cse7 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_10|))))) (store .cse6 |v_ULTIMATE.start_gl_insert_~node~1#1.base_10| (store (store (select .cse6 |v_ULTIMATE.start_gl_insert_~node~1#1.base_10|) (+ 12 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_10|) (+ 16 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_10|))))) (store .cse5 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9| (store (select .cse5 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|) |v_ULTIMATE.start_gl_insert_~node~1#1.offset_13| v_DerPreprocessor_10))))) (let ((.cse3 (select (select .cse4 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse2 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ |v_ULTIMATE.start___list_add_~next#1.offset_7| 4) |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|)))) (store .cse2 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9| (store (store (select .cse2 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|) |v_ULTIMATE.start___list_add_~new#1.offset_7| .cse3) (+ |v_ULTIMATE.start___list_add_~new#1.offset_7| 4) |c_~#gl_list~0.base|))))))) (store .cse1 |c_~#gl_list~0.base| (store (select .cse1 |c_~#gl_list~0.base|) |v_ULTIMATE.start___list_add_~prev#1.offset_7| |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|))))) (store .cse0 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9| (store (store (select .cse0 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|) (+ 12 |v_ULTIMATE.start_gl_insert_~node~1#1.offset_13|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|) (+ 16 |v_ULTIMATE.start_gl_insert_~node~1#1.offset_13|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|))) |c_~#gl_list~0.base|) (+ 4 |c_~#gl_list~0.offset|)) 0)) (= |v_ULTIMATE.start_gl_insert_~node~1#1.base_9| 0) (= |v_ULTIMATE.start_gl_insert_~node~1#1.base_10| 0) (not (= (select (store |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_10| 1) |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_10|) 0)))) (= |c_~#gl_list~0.base| 3) (= (select |c_#valid| 3) 1) (= |c_~#gl_list~0.offset| (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (= |c_~#gl_list~0.base| (select .cse11 |c_~#gl_list~0.offset|)) (= |c_~#gl_list~0.offset| 0) (= (select .cse11 (+ 4 |c_~#gl_list~0.offset|)) |c_~#gl_list~0.base|))) is different from false [2021-11-23 12:45:23,859 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|))) (and (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| 3)) (= |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 0) (= |c_~#gl_list~0.base| 3) (= (select |c_#valid| 3) 1) (= |c_~#gl_list~0.offset| (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (= |c_~#gl_list~0.base| (select .cse0 |c_~#gl_list~0.offset|)) (forall ((|v_ULTIMATE.start___list_add_~new#1.offset_8| Int) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_9| Int) (v_DerPreprocessor_11 Int) (|v_ULTIMATE.start___list_add_~prev#1.offset_7| Int) (v_DerPreprocessor_12 Int) (|v_ULTIMATE.start___list_add_~next#1.offset_7| Int) (|v_ULTIMATE.start___list_add_~new#1.offset_7| Int) (|v_ULTIMATE.start_gl_insert_~node~1#1.offset_13| Int) (|ULTIMATE.start_gl_insert_~node~1#1.offset| Int) (v_DerPreprocessor_10 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|) 0)) (= |v_ULTIMATE.start_gl_insert_~node~1#1.base_9| 0) (not (= (select (select (let ((.cse1 (let ((.cse2 (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse8 (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |ULTIMATE.start_gl_insert_~node~1#1.offset| v_DerPreprocessor_11)))) (let ((.cse10 (select (select .cse11 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse9 (store .cse11 .cse10 (store (select .cse11 .cse10) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |ULTIMATE.start_gl_insert_~node~1#1.offset| v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |v_ULTIMATE.start___list_add_~new#1.offset_8| .cse10) (+ |v_ULTIMATE.start___list_add_~new#1.offset_8| 4) |c_~#gl_list~0.base|))))))) (store .cse8 |c_~#gl_list~0.base| (store (select .cse8 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))))) (store .cse7 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse7 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (+ 12 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (+ 16 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))))) (store .cse6 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9| (store (select .cse6 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|) |v_ULTIMATE.start_gl_insert_~node~1#1.offset_13| v_DerPreprocessor_10))))) (let ((.cse4 (select (select .cse5 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse3 (store .cse5 .cse4 (store (select .cse5 .cse4) (+ |v_ULTIMATE.start___list_add_~next#1.offset_7| 4) |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|)))) (store .cse3 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9| (store (store (select .cse3 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|) |v_ULTIMATE.start___list_add_~new#1.offset_7| .cse4) (+ |v_ULTIMATE.start___list_add_~new#1.offset_7| 4) |c_~#gl_list~0.base|))))))) (store .cse2 |c_~#gl_list~0.base| (store (select .cse2 |c_~#gl_list~0.base|) |v_ULTIMATE.start___list_add_~prev#1.offset_7| |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|))))) (store .cse1 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9| (store (store (select .cse1 |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|) (+ 12 |v_ULTIMATE.start_gl_insert_~node~1#1.offset_13|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|) (+ 16 |v_ULTIMATE.start_gl_insert_~node~1#1.offset_13|) |v_ULTIMATE.start_gl_insert_~node~1#1.base_9|))) |c_~#gl_list~0.base|) (+ 4 |c_~#gl_list~0.offset|)) 0)))) (= |c_~#gl_list~0.offset| 0) (not (= |c_~#gl_list~0.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| 0)) (= (select .cse0 (+ 4 |c_~#gl_list~0.offset|)) |c_~#gl_list~0.base|) (= (select |c_#valid| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 1))) is different from false [2021-11-23 12:45:26,424 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|)) (.cse4 (+ 4 |c_~#gl_list~0.offset|))) (let ((.cse3 (select .cse10 .cse4)) (.cse0 (select .cse10 |c_~#gl_list~0.offset|))) (and (not (= |c_~#gl_list~0.base| .cse0)) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| 3)) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse0)) (exists ((|ULTIMATE.start_gl_insert_~node~1#1.offset| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse2))) (and (= (select .cse1 (+ 12 |ULTIMATE.start_gl_insert_~node~1#1.offset|)) .cse2) (= (select .cse1 (+ 16 |ULTIMATE.start_gl_insert_~node~1#1.offset|)) .cse2))))) (= |c_~#gl_list~0.base| 3) (not (= .cse0 0)) (= .cse3 .cse0) (or (= (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) .cse4) .cse4) (= .cse3 |c_~#gl_list~0.base|)) (not (= 3 .cse0)) (= |c_~#gl_list~0.offset| 0) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| 0)) (forall ((|v_ULTIMATE.start___list_add_~prev#1.offset_7| Int) (|v_ULTIMATE.start___list_add_~next#1.offset_7| Int) (|v_ULTIMATE.start___list_add_~new#1.offset_7| Int) (|ULTIMATE.start_gl_insert_~node~1#1.offset| Int) (v_DerPreprocessor_10 Int)) (not (= (select (select (let ((.cse5 (let ((.cse6 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |ULTIMATE.start_gl_insert_~node~1#1.offset| v_DerPreprocessor_10)))) (let ((.cse8 (select (select .cse9 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse7 (store .cse9 .cse8 (store (select .cse9 .cse8) (+ |v_ULTIMATE.start___list_add_~next#1.offset_7| 4) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store .cse7 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse7 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |v_ULTIMATE.start___list_add_~new#1.offset_7| .cse8) (+ |v_ULTIMATE.start___list_add_~new#1.offset_7| 4) |c_~#gl_list~0.base|))))))) (store .cse6 |c_~#gl_list~0.base| (store (select .cse6 |c_~#gl_list~0.base|) |v_ULTIMATE.start___list_add_~prev#1.offset_7| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))))) (store .cse5 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse5 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (+ 12 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (+ 16 |ULTIMATE.start_gl_insert_~node~1#1.offset|) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) |c_~#gl_list~0.base|) (+ 4 |c_~#gl_list~0.offset|)) 0)))))) is different from false [2021-11-23 12:45:32,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:45:32,592 INFO L93 Difference]: Finished difference Result 379 states and 394 transitions. [2021-11-23 12:45:32,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-23 12:45:32,593 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 29 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-23 12:45:32,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:45:32,597 INFO L225 Difference]: With dead ends: 379 [2021-11-23 12:45:32,597 INFO L226 Difference]: Without dead ends: 377 [2021-11-23 12:45:32,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 191.3s TimeCoverageRelationStatistics Valid=158, Invalid=911, Unknown=11, NotChecked=402, Total=1482 [2021-11-23 12:45:32,599 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 284 mSDsluCounter, 1871 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 2056 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 756 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-23 12:45:32,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 2056 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 657 Invalid, 0 Unknown, 756 Unchecked, 0.8s Time] [2021-11-23 12:45:32,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-11-23 12:45:32,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 307. [2021-11-23 12:45:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 280 states have (on average 1.175) internal successors, (329), 306 states have internal predecessors, (329), 0 states have call successors, (0), 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-11-23 12:45:32,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 329 transitions. [2021-11-23 12:45:32,624 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 329 transitions. Word has length 34 [2021-11-23 12:45:32,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:45:32,625 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 329 transitions. [2021-11-23 12:45:32,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 29 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:45:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 329 transitions. [2021-11-23 12:45:32,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 12:45:32,626 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:45:32,627 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2021-11-23 12:45:32,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 12:45:32,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-23 12:45:32,840 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2021-11-23 12:45:32,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:45:32,840 INFO L85 PathProgramCache]: Analyzing trace with hash -383593684, now seen corresponding path program 1 times [2021-11-23 12:45:32,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:45:32,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038489759] [2021-11-23 12:45:32,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:45:32,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:45:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:45:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:45:33,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:45:33,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038489759] [2021-11-23 12:45:33,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038489759] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:45:33,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:45:33,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-23 12:45:33,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248645711] [2021-11-23 12:45:33,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:45:33,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 12:45:33,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:45:33,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 12:45:33,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-23 12:45:33,188 INFO L87 Difference]: Start difference. First operand 307 states and 329 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:45:35,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:45:35,194 INFO L93 Difference]: Finished difference Result 368 states and 382 transitions. [2021-11-23 12:45:35,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 12:45:35,206 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-23 12:45:35,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:45:35,209 INFO L225 Difference]: With dead ends: 368 [2021-11-23 12:45:35,210 INFO L226 Difference]: Without dead ends: 364 [2021-11-23 12:45:35,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-11-23 12:45:35,212 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 485 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-23 12:45:35,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 975 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-23 12:45:35,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-11-23 12:45:35,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 310. [2021-11-23 12:45:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 283 states have (on average 1.1696113074204948) internal successors, (331), 309 states have internal predecessors, (331), 0 states have call successors, (0), 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-11-23 12:45:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 331 transitions. [2021-11-23 12:45:35,237 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 331 transitions. Word has length 36 [2021-11-23 12:45:35,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:45:35,238 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 331 transitions. [2021-11-23 12:45:35,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:45:35,238 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 331 transitions. [2021-11-23 12:45:35,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 12:45:35,239 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:45:35,239 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:45:35,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-23 12:45:35,240 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2021-11-23 12:45:35,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:45:35,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2014003245, now seen corresponding path program 1 times [2021-11-23 12:45:35,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:45:35,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749957982] [2021-11-23 12:45:35,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:45:35,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:45:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:45:35,836 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:45:35,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:45:35,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749957982] [2021-11-23 12:45:35,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749957982] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:45:35,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165856956] [2021-11-23 12:45:35,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:45:35,838 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:45:35,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:45:35,839 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:45:35,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23008c1f-5e93-4c13-9018-685a1be849b9/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 12:45:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:45:35,995 WARN L261 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 116 conjunts are in the unsatisfiable core [2021-11-23 12:45:36,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:45:36,127 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 12:45:36,127 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-11-23 12:45:36,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:45:36,506 INFO L354 Elim1Store]: treesize reduction 263, result has 12.3 percent of original size [2021-11-23 12:45:36,506 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 365 treesize of output 187 [2021-11-23 12:45:36,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:45:36,572 INFO L354 Elim1Store]: treesize reduction 67, result has 31.6 percent of original size [2021-11-23 12:45:36,573 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 230 treesize of output 108 [2021-11-23 12:45:36,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:45:36,971 INFO L354 Elim1Store]: treesize reduction 456, result has 10.6 percent of original size [2021-11-23 12:45:36,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 191 treesize of output 158 [2021-11-23 12:45:36,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:45:37,088 INFO L354 Elim1Store]: treesize reduction 448, result has 11.8 percent of original size [2021-11-23 12:45:37,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 215 treesize of output 203 [2021-11-23 12:45:37,649 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-11-23 12:45:37,649 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 22 treesize of output 24 [2021-11-23 12:45:37,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:45:37,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:45:38,985 INFO L354 Elim1Store]: treesize reduction 1787, result has 6.3 percent of original size [2021-11-23 12:45:38,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 23 case distinctions, treesize of input 529 treesize of output 342 [2021-11-23 12:45:39,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:45:39,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:45:39,607 INFO L354 Elim1Store]: treesize reduction 2139, result has 5.8 percent of original size [2021-11-23 12:45:39,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 23 case distinctions, treesize of input 479 treesize of output 364 [2021-11-23 12:46:21,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:46:22,372 INFO L354 Elim1Store]: treesize reduction 1526, result has 8.7 percent of original size [2021-11-23 12:46:22,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 14 new quantified variables, introduced 55 case distinctions, treesize of input 561 treesize of output 453 [2021-11-23 12:46:22,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:46:23,034 INFO L354 Elim1Store]: treesize reduction 1788, result has 7.7 percent of original size [2021-11-23 12:46:23,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 15 new quantified variables, introduced 55 case distinctions, treesize of input 581 treesize of output 472