./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 05:10:26,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 05:10:26,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 05:10:26,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 05:10:26,351 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 05:10:26,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 05:10:26,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 05:10:26,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 05:10:26,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 05:10:26,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 05:10:26,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 05:10:26,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 05:10:26,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 05:10:26,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 05:10:26,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 05:10:26,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 05:10:26,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 05:10:26,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 05:10:26,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 05:10:26,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 05:10:26,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 05:10:26,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 05:10:26,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 05:10:26,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 05:10:26,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 05:10:26,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 05:10:26,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 05:10:26,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 05:10:26,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 05:10:26,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 05:10:26,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 05:10:26,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 05:10:26,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 05:10:26,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 05:10:26,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 05:10:26,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 05:10:26,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 05:10:26,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 05:10:26,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 05:10:26,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 05:10:26,434 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 05:10:26,436 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-11-19 05:10:26,493 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 05:10:26,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 05:10:26,495 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-19 05:10:26,495 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-19 05:10:26,496 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 05:10:26,497 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 05:10:26,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-19 05:10:26,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-19 05:10:26,499 INFO L138 SettingsManager]: * Use SBE=true [2021-11-19 05:10:26,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 05:10:26,500 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 05:10:26,501 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-19 05:10:26,501 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 05:10:26,501 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 05:10:26,502 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 05:10:26,502 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-19 05:10:26,502 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-19 05:10:26,503 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-19 05:10:26,503 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 05:10:26,503 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 05:10:26,504 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 05:10:26,504 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 05:10:26,504 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 05:10:26,505 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-19 05:10:26,505 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 05:10:26,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 05:10:26,506 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 05:10:26,506 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 05:10:26,506 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-19 05:10:26,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 05:10:26,509 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 05:10:26,509 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_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/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_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc [2021-11-19 05:10:26,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 05:10:26,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 05:10:26,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 05:10:26,905 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 05:10:26,906 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 05:10:26,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2021-11-19 05:10:26,998 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/data/e583cffa9/e287fb6114f1456b9d9a1eb2db5c07df/FLAGff8fbdca2 [2021-11-19 05:10:27,754 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 05:10:27,755 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2021-11-19 05:10:27,785 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/data/e583cffa9/e287fb6114f1456b9d9a1eb2db5c07df/FLAGff8fbdca2 [2021-11-19 05:10:27,951 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/data/e583cffa9/e287fb6114f1456b9d9a1eb2db5c07df [2021-11-19 05:10:27,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 05:10:27,959 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-11-19 05:10:27,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 05:10:27,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 05:10:27,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 05:10:27,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:10:27" (1/1) ... [2021-11-19 05:10:27,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d34c5e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:27, skipping insertion in model container [2021-11-19 05:10:27,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:10:27" (1/1) ... [2021-11-19 05:10:27,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 05:10:28,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 05:10:28,431 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_654b9155-c992-463d-b2e1-59df7109b574/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i[24092,24105] [2021-11-19 05:10:28,434 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 05:10:28,445 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 05:10:28,511 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_654b9155-c992-463d-b2e1-59df7109b574/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i[24092,24105] [2021-11-19 05:10:28,516 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 05:10:28,568 INFO L208 MainTranslator]: Completed translation [2021-11-19 05:10:28,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:28 WrapperNode [2021-11-19 05:10:28,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 05:10:28,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 05:10:28,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 05:10:28,573 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 05:10:28,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:28" (1/1) ... [2021-11-19 05:10:28,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:28" (1/1) ... [2021-11-19 05:10:28,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:28" (1/1) ... [2021-11-19 05:10:28,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:28" (1/1) ... [2021-11-19 05:10:28,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:28" (1/1) ... [2021-11-19 05:10:28,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:28" (1/1) ... [2021-11-19 05:10:28,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:28" (1/1) ... [2021-11-19 05:10:28,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 05:10:28,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 05:10:28,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 05:10:28,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 05:10:28,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:28" (1/1) ... [2021-11-19 05:10:28,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 05:10:28,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 05:10:28,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 05:10:28,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 05:10:28,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-11-19 05:10:28,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 05:10:28,826 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-11-19 05:10:28,827 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-11-19 05:10:28,827 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-11-19 05:10:28,827 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-11-19 05:10:28,828 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2021-11-19 05:10:28,829 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-11-19 05:10:28,829 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-11-19 05:10:28,829 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-11-19 05:10:28,830 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-11-19 05:10:28,830 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-11-19 05:10:28,830 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-11-19 05:10:28,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 05:10:28,831 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-11-19 05:10:28,831 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-11-19 05:10:28,831 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-11-19 05:10:28,831 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-11-19 05:10:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-11-19 05:10:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-11-19 05:10:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-11-19 05:10:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-11-19 05:10:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-11-19 05:10:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-11-19 05:10:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-11-19 05:10:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-11-19 05:10:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-11-19 05:10:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-11-19 05:10:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-11-19 05:10:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-11-19 05:10:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-11-19 05:10:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-11-19 05:10:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-11-19 05:10:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-11-19 05:10:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-11-19 05:10:28,836 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-11-19 05:10:28,836 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-11-19 05:10:28,836 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-11-19 05:10:28,836 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-11-19 05:10:28,837 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-11-19 05:10:28,837 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-11-19 05:10:28,837 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-11-19 05:10:28,838 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-11-19 05:10:28,838 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-11-19 05:10:28,838 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-11-19 05:10:28,839 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-11-19 05:10:28,839 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-11-19 05:10:28,840 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-11-19 05:10:28,841 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-11-19 05:10:28,841 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-11-19 05:10:28,841 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-11-19 05:10:28,841 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-11-19 05:10:28,841 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-11-19 05:10:28,842 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-11-19 05:10:28,842 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-11-19 05:10:28,842 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-11-19 05:10:28,842 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-11-19 05:10:28,843 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-11-19 05:10:28,843 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-11-19 05:10:28,844 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-11-19 05:10:28,844 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-11-19 05:10:28,844 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-11-19 05:10:28,845 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-11-19 05:10:28,845 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-11-19 05:10:28,847 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-11-19 05:10:28,847 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-11-19 05:10:28,848 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-11-19 05:10:28,848 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-11-19 05:10:28,849 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-11-19 05:10:28,849 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-11-19 05:10:28,849 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-11-19 05:10:28,849 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-11-19 05:10:28,850 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-11-19 05:10:28,850 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-11-19 05:10:28,850 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-11-19 05:10:28,850 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-11-19 05:10:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-11-19 05:10:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-11-19 05:10:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-11-19 05:10:28,852 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-11-19 05:10:28,853 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-11-19 05:10:28,853 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-11-19 05:10:28,853 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-11-19 05:10:28,854 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-11-19 05:10:28,854 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-11-19 05:10:28,854 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-11-19 05:10:28,855 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-11-19 05:10:28,855 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-11-19 05:10:28,855 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-11-19 05:10:28,855 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-11-19 05:10:28,856 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-11-19 05:10:28,856 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-11-19 05:10:28,856 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-11-19 05:10:28,857 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-11-19 05:10:28,857 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-11-19 05:10:28,857 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-11-19 05:10:28,857 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-11-19 05:10:28,858 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-11-19 05:10:28,858 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-11-19 05:10:28,858 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-11-19 05:10:28,858 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-11-19 05:10:28,859 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-11-19 05:10:28,859 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-11-19 05:10:28,860 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-11-19 05:10:28,860 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-11-19 05:10:28,860 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-11-19 05:10:28,861 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-11-19 05:10:28,862 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-11-19 05:10:28,862 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-11-19 05:10:28,862 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-11-19 05:10:28,863 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-11-19 05:10:28,863 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-11-19 05:10:28,863 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-11-19 05:10:28,863 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-11-19 05:10:28,863 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-11-19 05:10:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-11-19 05:10:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-11-19 05:10:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-11-19 05:10:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-11-19 05:10:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2021-11-19 05:10:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-19 05:10:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-19 05:10:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-19 05:10:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-11-19 05:10:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-19 05:10:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-19 05:10:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-19 05:10:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-11-19 05:10:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-19 05:10:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 05:10:29,252 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 05:10:29,255 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 05:10:29,304 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-11-19 05:10:29,580 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 05:10:29,590 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 05:10:29,590 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-19 05:10:29,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:10:29 BoogieIcfgContainer [2021-11-19 05:10:29,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 05:10:29,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 05:10:29,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 05:10:29,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 05:10:29,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:10:27" (1/3) ... [2021-11-19 05:10:29,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e451460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:10:29, skipping insertion in model container [2021-11-19 05:10:29,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:10:28" (2/3) ... [2021-11-19 05:10:29,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e451460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:10:29, skipping insertion in model container [2021-11-19 05:10:29,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:10:29" (3/3) ... [2021-11-19 05:10:29,625 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2021-11-19 05:10:29,631 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 05:10:29,632 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2021-11-19 05:10:29,700 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 05:10:29,708 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-19 05:10:29,708 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2021-11-19 05:10:29,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 64 states have internal predecessors, (73), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 05:10:29,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-19 05:10:29,741 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 05:10:29,741 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 05:10:29,742 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting sll_circular_createErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 20 more)] === [2021-11-19 05:10:29,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:10:29,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1247263958, now seen corresponding path program 1 times [2021-11-19 05:10:29,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:10:29,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257883160] [2021-11-19 05:10:29,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:10:29,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:10:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:30,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 05:10:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:30,066 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-19 05:10:30,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:10:30,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257883160] [2021-11-19 05:10:30,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257883160] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:10:30,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:10:30,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 05:10:30,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515771343] [2021-11-19 05:10:30,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:10:30,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 05:10:30,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:10:30,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 05:10:30,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 05:10:30,131 INFO L87 Difference]: Start difference. First operand has 72 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 64 states have internal predecessors, (73), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 05:10:30,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:10:30,434 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2021-11-19 05:10:30,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 05:10:30,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-11-19 05:10:30,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 05:10:30,450 INFO L225 Difference]: With dead ends: 69 [2021-11-19 05:10:30,451 INFO L226 Difference]: Without dead ends: 62 [2021-11-19 05:10:30,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-19 05:10:30,460 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 82 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 05:10:30,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 69 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-19 05:10:30,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-19 05:10:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-11-19 05:10:30,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 05:10:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2021-11-19 05:10:30,520 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 10 [2021-11-19 05:10:30,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 05:10:30,522 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2021-11-19 05:10:30,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 05:10:30,523 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2021-11-19 05:10:30,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-19 05:10:30,524 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 05:10:30,524 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 05:10:30,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 05:10:30,526 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting sll_circular_createErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 20 more)] === [2021-11-19 05:10:30,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:10:30,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1247263959, now seen corresponding path program 1 times [2021-11-19 05:10:30,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:10:30,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257220107] [2021-11-19 05:10:30,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:10:30,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:10:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:30,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 05:10:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:30,629 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-19 05:10:30,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:10:30,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257220107] [2021-11-19 05:10:30,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257220107] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:10:30,630 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:10:30,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 05:10:30,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399467556] [2021-11-19 05:10:30,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:10:30,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 05:10:30,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:10:30,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 05:10:30,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 05:10:30,634 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 05:10:30,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:10:30,790 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2021-11-19 05:10:30,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 05:10:30,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-11-19 05:10:30,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 05:10:30,792 INFO L225 Difference]: With dead ends: 59 [2021-11-19 05:10:30,792 INFO L226 Difference]: Without dead ends: 59 [2021-11-19 05:10:30,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-19 05:10:30,795 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 69 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 05:10:30,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 58 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 05:10:30,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-11-19 05:10:30,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-11-19 05:10:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 53 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 05:10:30,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2021-11-19 05:10:30,806 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 10 [2021-11-19 05:10:30,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 05:10:30,807 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2021-11-19 05:10:30,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 05:10:30,807 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2021-11-19 05:10:30,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-19 05:10:30,808 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 05:10:30,809 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 05:10:30,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-19 05:10:30,809 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting sll_circular_createErr4REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 20 more)] === [2021-11-19 05:10:30,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:10:30,810 INFO L85 PathProgramCache]: Analyzing trace with hash -738269866, now seen corresponding path program 1 times [2021-11-19 05:10:30,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:10:30,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548381774] [2021-11-19 05:10:30,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:10:30,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:10:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:30,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 05:10:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:30,906 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-19 05:10:30,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:10:30,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548381774] [2021-11-19 05:10:30,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548381774] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:10:30,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:10:30,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 05:10:30,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420016271] [2021-11-19 05:10:30,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:10:30,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 05:10:30,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:10:30,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 05:10:30,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 05:10:30,910 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 05:10:31,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:10:31,063 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2021-11-19 05:10:31,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 05:10:31,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-11-19 05:10:31,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 05:10:31,067 INFO L225 Difference]: With dead ends: 62 [2021-11-19 05:10:31,067 INFO L226 Difference]: Without dead ends: 62 [2021-11-19 05:10:31,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-19 05:10:31,069 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 62 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 05:10:31,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 63 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 05:10:31,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-19 05:10:31,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2021-11-19 05:10:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 51 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 05:10:31,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2021-11-19 05:10:31,080 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 15 [2021-11-19 05:10:31,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 05:10:31,080 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2021-11-19 05:10:31,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 05:10:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2021-11-19 05:10:31,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-19 05:10:31,082 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 05:10:31,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 05:10:31,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-19 05:10:31,082 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting sll_circular_createErr5REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 20 more)] === [2021-11-19 05:10:31,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:10:31,085 INFO L85 PathProgramCache]: Analyzing trace with hash -738269865, now seen corresponding path program 1 times [2021-11-19 05:10:31,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:10:31,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427134466] [2021-11-19 05:10:31,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:10:31,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:10:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:31,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 05:10:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:31,223 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-19 05:10:31,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:10:31,224 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427134466] [2021-11-19 05:10:31,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427134466] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:10:31,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:10:31,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 05:10:31,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88822256] [2021-11-19 05:10:31,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:10:31,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 05:10:31,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:10:31,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 05:10:31,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 05:10:31,227 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 05:10:31,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:10:31,356 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2021-11-19 05:10:31,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 05:10:31,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-11-19 05:10:31,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 05:10:31,358 INFO L225 Difference]: With dead ends: 60 [2021-11-19 05:10:31,359 INFO L226 Difference]: Without dead ends: 60 [2021-11-19 05:10:31,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-19 05:10:31,361 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 58 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 05:10:31,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 63 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 05:10:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-11-19 05:10:31,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2021-11-19 05:10:31,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 49 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 05:10:31,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2021-11-19 05:10:31,370 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 15 [2021-11-19 05:10:31,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 05:10:31,371 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2021-11-19 05:10:31,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 05:10:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2021-11-19 05:10:31,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-19 05:10:31,373 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 05:10:31,373 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 05:10:31,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-19 05:10:31,373 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 20 more)] === [2021-11-19 05:10:31,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:10:31,374 INFO L85 PathProgramCache]: Analyzing trace with hash -262950274, now seen corresponding path program 1 times [2021-11-19 05:10:31,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:10:31,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806022908] [2021-11-19 05:10:31,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:10:31,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:10:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:31,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 05:10:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:31,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 05:10:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:31,542 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-19 05:10:31,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:10:31,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806022908] [2021-11-19 05:10:31,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806022908] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:10:31,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:10:31,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-19 05:10:31,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131068083] [2021-11-19 05:10:31,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:10:31,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-19 05:10:31,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:10:31,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-19 05:10:31,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-19 05:10:31,546 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 05:10:32,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:10:32,038 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2021-11-19 05:10:32,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-19 05:10:32,038 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2021-11-19 05:10:32,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 05:10:32,040 INFO L225 Difference]: With dead ends: 63 [2021-11-19 05:10:32,040 INFO L226 Difference]: Without dead ends: 63 [2021-11-19 05:10:32,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-11-19 05:10:32,042 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 93 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-19 05:10:32,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 43 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-19 05:10:32,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-11-19 05:10:32,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2021-11-19 05:10:32,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 51 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-19 05:10:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2021-11-19 05:10:32,064 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 19 [2021-11-19 05:10:32,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 05:10:32,065 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2021-11-19 05:10:32,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 05:10:32,071 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2021-11-19 05:10:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-19 05:10:32,072 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 05:10:32,073 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 05:10:32,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-19 05:10:32,074 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 20 more)] === [2021-11-19 05:10:32,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:10:32,076 INFO L85 PathProgramCache]: Analyzing trace with hash -262950273, now seen corresponding path program 1 times [2021-11-19 05:10:32,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:10:32,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474920063] [2021-11-19 05:10:32,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:10:32,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:10:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:32,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 05:10:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:32,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 05:10:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:32,194 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-19 05:10:32,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:10:32,195 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474920063] [2021-11-19 05:10:32,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474920063] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:10:32,195 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:10:32,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-19 05:10:32,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926558991] [2021-11-19 05:10:32,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:10:32,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-19 05:10:32,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:10:32,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-19 05:10:32,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-19 05:10:32,198 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 05:10:32,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:10:32,478 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2021-11-19 05:10:32,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-19 05:10:32,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2021-11-19 05:10:32,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 05:10:32,480 INFO L225 Difference]: With dead ends: 60 [2021-11-19 05:10:32,480 INFO L226 Difference]: Without dead ends: 56 [2021-11-19 05:10:32,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-19 05:10:32,482 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 96 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 05:10:32,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 58 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-19 05:10:32,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-11-19 05:10:32,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2021-11-19 05:10:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 05:10:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2021-11-19 05:10:32,490 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 19 [2021-11-19 05:10:32,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 05:10:32,490 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2021-11-19 05:10:32,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 05:10:32,491 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2021-11-19 05:10:32,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-19 05:10:32,492 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 05:10:32,492 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-19 05:10:32,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-19 05:10:32,492 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 20 more)] === [2021-11-19 05:10:32,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:10:32,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1739384034, now seen corresponding path program 1 times [2021-11-19 05:10:32,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:10:32,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929038680] [2021-11-19 05:10:32,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:10:32,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:10:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:32,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 05:10:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:32,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 05:10:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:32,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:10:32,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:10:32,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929038680] [2021-11-19 05:10:32,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929038680] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:10:32,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:10:32,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-19 05:10:32,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233924623] [2021-11-19 05:10:32,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:10:32,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-19 05:10:32,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:10:32,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-19 05:10:32,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-19 05:10:32,725 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 05:10:33,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:10:33,099 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2021-11-19 05:10:33,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-19 05:10:33,100 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-11-19 05:10:33,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 05:10:33,101 INFO L225 Difference]: With dead ends: 58 [2021-11-19 05:10:33,102 INFO L226 Difference]: Without dead ends: 58 [2021-11-19 05:10:33,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-11-19 05:10:33,103 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 77 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-19 05:10:33,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 44 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-19 05:10:33,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-11-19 05:10:33,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2021-11-19 05:10:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 05:10:33,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2021-11-19 05:10:33,110 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 24 [2021-11-19 05:10:33,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 05:10:33,110 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2021-11-19 05:10:33,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 05:10:33,111 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2021-11-19 05:10:33,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-19 05:10:33,112 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 05:10:33,112 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-19 05:10:33,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-19 05:10:33,112 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 20 more)] === [2021-11-19 05:10:33,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:10:33,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1739384033, now seen corresponding path program 1 times [2021-11-19 05:10:33,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:10:33,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926978870] [2021-11-19 05:10:33,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:10:33,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:10:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:33,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 05:10:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:33,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 05:10:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:33,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:10:33,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:10:33,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926978870] [2021-11-19 05:10:33,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926978870] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:10:33,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:10:33,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-19 05:10:33,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935069869] [2021-11-19 05:10:33,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:10:33,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-19 05:10:33,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:10:33,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-19 05:10:33,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-19 05:10:33,376 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 05:10:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:10:33,812 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2021-11-19 05:10:33,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-19 05:10:33,813 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-11-19 05:10:33,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 05:10:33,814 INFO L225 Difference]: With dead ends: 63 [2021-11-19 05:10:33,814 INFO L226 Difference]: Without dead ends: 63 [2021-11-19 05:10:33,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2021-11-19 05:10:33,815 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 81 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-19 05:10:33,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 52 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-19 05:10:33,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-11-19 05:10:33,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2021-11-19 05:10:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.375) internal successors, (55), 50 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 05:10:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-11-19 05:10:33,822 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 24 [2021-11-19 05:10:33,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 05:10:33,822 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-11-19 05:10:33,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 05:10:33,823 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-11-19 05:10:33,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-19 05:10:33,824 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 05:10:33,824 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] [2021-11-19 05:10:33,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-19 05:10:33,824 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr13ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 20 more)] === [2021-11-19 05:10:33,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:10:33,825 INFO L85 PathProgramCache]: Analyzing trace with hash -805778576, now seen corresponding path program 1 times [2021-11-19 05:10:33,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:10:33,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596373757] [2021-11-19 05:10:33,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:10:33,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:10:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:33,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 05:10:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:33,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 05:10:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:10:33,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:10:33,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596373757] [2021-11-19 05:10:33,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596373757] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 05:10:33,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950734803] [2021-11-19 05:10:33,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:10:33,939 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 05:10:33,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 05:10:33,941 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 05:10:33,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-19 05:10:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:34,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 05:10:34,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 05:10:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:10:34,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 05:10:34,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:10:34,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950734803] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 05:10:34,539 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 05:10:34,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2021-11-19 05:10:34,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959299409] [2021-11-19 05:10:34,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 05:10:34,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-19 05:10:34,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:10:34,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-19 05:10:34,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-19 05:10:34,560 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 12 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 05:10:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:10:34,984 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-11-19 05:10:34,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-19 05:10:34,985 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2021-11-19 05:10:34,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 05:10:34,986 INFO L225 Difference]: With dead ends: 69 [2021-11-19 05:10:34,986 INFO L226 Difference]: Without dead ends: 65 [2021-11-19 05:10:34,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2021-11-19 05:10:34,988 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 145 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-19 05:10:34,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 67 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-19 05:10:34,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-11-19 05:10:35,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2021-11-19 05:10:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 05:10:35,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2021-11-19 05:10:35,007 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 26 [2021-11-19 05:10:35,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 05:10:35,009 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2021-11-19 05:10:35,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 05:10:35,009 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2021-11-19 05:10:35,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-19 05:10:35,012 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 05:10:35,012 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 05:10:35,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-19 05:10:35,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 05:10:35,236 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr13ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 20 more)] === [2021-11-19 05:10:35,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:10:35,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1645244112, now seen corresponding path program 2 times [2021-11-19 05:10:35,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:10:35,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513557985] [2021-11-19 05:10:35,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:10:35,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:10:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:35,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 05:10:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:35,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 05:10:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:35,419 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:10:35,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:10:35,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513557985] [2021-11-19 05:10:35,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513557985] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 05:10:35,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299819954] [2021-11-19 05:10:35,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-19 05:10:35,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 05:10:35,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 05:10:35,422 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 05:10:35,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-19 05:10:35,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-19 05:10:35,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 05:10:35,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-19 05:10:35,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 05:10:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:10:35,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 05:10:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:10:36,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299819954] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 05:10:36,135 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 05:10:36,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2021-11-19 05:10:36,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348982653] [2021-11-19 05:10:36,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 05:10:36,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-19 05:10:36,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:10:36,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-19 05:10:36,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-11-19 05:10:36,138 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 14 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 05:10:36,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:10:36,506 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2021-11-19 05:10:36,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-19 05:10:36,507 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2021-11-19 05:10:36,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 05:10:36,509 INFO L225 Difference]: With dead ends: 74 [2021-11-19 05:10:36,509 INFO L226 Difference]: Without dead ends: 70 [2021-11-19 05:10:36,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2021-11-19 05:10:36,510 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 172 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 05:10:36,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 58 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-19 05:10:36,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-11-19 05:10:36,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2021-11-19 05:10:36,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 50 states have (on average 1.3) internal successors, (65), 60 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 05:10:36,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2021-11-19 05:10:36,517 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 31 [2021-11-19 05:10:36,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 05:10:36,518 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2021-11-19 05:10:36,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 05:10:36,518 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2021-11-19 05:10:36,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-19 05:10:36,520 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 05:10:36,521 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 05:10:36,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-19 05:10:36,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 05:10:36,746 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr13ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 20 more)] === [2021-11-19 05:10:36,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:10:36,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1343743856, now seen corresponding path program 3 times [2021-11-19 05:10:36,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:10:36,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696325447] [2021-11-19 05:10:36,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:10:36,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:10:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:36,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 05:10:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:36,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 05:10:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:10:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:10:36,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:10:36,922 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696325447] [2021-11-19 05:10:36,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696325447] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 05:10:36,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222781394] [2021-11-19 05:10:36,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 05:10:36,923 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 05:10:36,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 05:10:36,924 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 05:10:36,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-19 05:10:37,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-19 05:10:37,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 05:10:37,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-19 05:10:37,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 05:10:37,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-19 05:10:37,481 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-11-19 05:10:37,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2021-11-19 05:10:37,667 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 22 treesize of output 10 [2021-11-19 05:10:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-19 05:10:37,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 05:10:37,910 INFO L354 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2021-11-19 05:10:37,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 1 [2021-11-19 05:10:40,037 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 Int) (sll_circular_create_~last~0.base Int)) (= (select (select (store |c_#memory_int| sll_circular_create_~last~0.base (store (select |c_#memory_int| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_DerPreprocessor_1)) c_sll_circular_create_~head~0.base) (+ c_sll_circular_create_~head~0.offset 4)) |c_sll_circular_create_#in~data|)) is different from false [2021-11-19 05:10:42,059 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 Int) (sll_circular_create_~last~0.base Int)) (= (select (select (store |c_#memory_int| sll_circular_create_~last~0.base (store (select |c_#memory_int| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_DerPreprocessor_1)) c_sll_circular_create_~new_head~0.base) (+ c_sll_circular_create_~new_head~0.offset 4)) |c_sll_circular_create_#in~data|)) is different from false [2021-11-19 05:10:42,364 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 5 not checked. [2021-11-19 05:10:42,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222781394] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 05:10:42,366 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 05:10:42,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 29 [2021-11-19 05:10:42,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006727110] [2021-11-19 05:10:42,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 05:10:42,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-19 05:10:42,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:10:42,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-19 05:10:42,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=633, Unknown=2, NotChecked=102, Total=812 [2021-11-19 05:10:42,373 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 29 states, 27 states have (on average 2.740740740740741) internal successors, (74), 25 states have internal predecessors, (74), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-19 05:10:43,845 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_sll_circular_create_~new_head~0.base) (+ c_sll_circular_create_~new_head~0.offset 4)) |c_sll_circular_create_#in~data|) (= c_sll_circular_create_~data |c_sll_circular_create_#in~data|) (= |c_sll_circular_create_#in~len| c_sll_circular_create_~len) (<= c_sll_circular_create_~last~0.offset 0) (forall ((v_DerPreprocessor_1 Int) (sll_circular_create_~last~0.base Int)) (= (select (select (store |c_#memory_int| sll_circular_create_~last~0.base (store (select |c_#memory_int| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_DerPreprocessor_1)) c_sll_circular_create_~new_head~0.base) (+ c_sll_circular_create_~new_head~0.offset 4)) |c_sll_circular_create_#in~data|)) (<= 0 c_sll_circular_create_~new_head~0.offset) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(#NULL.base)| |c_#NULL.base|)) is different from false [2021-11-19 05:10:45,092 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_sll_circular_create_#in~len| (+ c_sll_circular_create_~len 1)) (= c_sll_circular_create_~data |c_sll_circular_create_#in~data|) (forall ((v_DerPreprocessor_1 Int) (sll_circular_create_~last~0.base Int)) (= (select (select (store |c_#memory_int| sll_circular_create_~last~0.base (store (select |c_#memory_int| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_DerPreprocessor_1)) c_sll_circular_create_~head~0.base) (+ c_sll_circular_create_~head~0.offset 4)) |c_sll_circular_create_#in~data|)) (<= 0 c_sll_circular_create_~head~0.offset) (= (select (select |c_#memory_int| c_sll_circular_create_~head~0.base) (+ c_sll_circular_create_~head~0.offset 4)) |c_sll_circular_create_#in~data|) (<= c_sll_circular_create_~last~0.offset 0)) is different from false [2021-11-19 05:10:47,189 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_sll_circular_create_~new_head~0.base) (+ c_sll_circular_create_~new_head~0.offset 4)) |c_sll_circular_create_#in~data|) (<= |c_sll_circular_create_#in~len| (+ c_sll_circular_create_~len 1)) (= c_sll_circular_create_~data |c_sll_circular_create_#in~data|) (<= c_sll_circular_create_~last~0.offset 0) (forall ((v_DerPreprocessor_1 Int) (sll_circular_create_~last~0.base Int)) (= (select (select (store |c_#memory_int| sll_circular_create_~last~0.base (store (select |c_#memory_int| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_DerPreprocessor_1)) c_sll_circular_create_~new_head~0.base) (+ c_sll_circular_create_~new_head~0.offset 4)) |c_sll_circular_create_#in~data|)) (<= 0 c_sll_circular_create_~new_head~0.offset) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(#NULL.base)| |c_#NULL.base|)) is different from false [2021-11-19 05:10:49,094 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_sll_circular_create_#in~len| (+ 2 c_sll_circular_create_~len)) (= c_sll_circular_create_~data |c_sll_circular_create_#in~data|) (forall ((v_DerPreprocessor_1 Int) (sll_circular_create_~last~0.base Int)) (= (select (select (store |c_#memory_int| sll_circular_create_~last~0.base (store (select |c_#memory_int| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_DerPreprocessor_1)) c_sll_circular_create_~head~0.base) (+ c_sll_circular_create_~head~0.offset 4)) |c_sll_circular_create_#in~data|)) (<= 0 c_sll_circular_create_~head~0.offset) (= (select (select |c_#memory_int| c_sll_circular_create_~head~0.base) (+ c_sll_circular_create_~head~0.offset 4)) |c_sll_circular_create_#in~data|) (<= c_sll_circular_create_~last~0.offset 0)) is different from false [2021-11-19 05:10:51,175 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_sll_circular_create_#in~len| (+ 2 c_sll_circular_create_~len)) (= (select (select |c_#memory_int| c_sll_circular_create_~new_head~0.base) (+ c_sll_circular_create_~new_head~0.offset 4)) |c_sll_circular_create_#in~data|) (= c_sll_circular_create_~data |c_sll_circular_create_#in~data|) (<= c_sll_circular_create_~last~0.offset 0) (forall ((v_DerPreprocessor_1 Int) (sll_circular_create_~last~0.base Int)) (= (select (select (store |c_#memory_int| sll_circular_create_~last~0.base (store (select |c_#memory_int| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_DerPreprocessor_1)) c_sll_circular_create_~new_head~0.base) (+ c_sll_circular_create_~new_head~0.offset 4)) |c_sll_circular_create_#in~data|)) (<= 0 c_sll_circular_create_~new_head~0.offset) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(#NULL.base)| |c_#NULL.base|)) is different from false [2021-11-19 05:10:52,586 WARN L838 $PredicateComparison]: unable to prove that (and (= c_sll_circular_create_~data |c_sll_circular_create_#in~data|) (<= |c_sll_circular_create_#in~len| (+ 3 c_sll_circular_create_~len)) (forall ((v_DerPreprocessor_1 Int) (sll_circular_create_~last~0.base Int)) (= (select (select (store |c_#memory_int| sll_circular_create_~last~0.base (store (select |c_#memory_int| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_DerPreprocessor_1)) c_sll_circular_create_~head~0.base) (+ c_sll_circular_create_~head~0.offset 4)) |c_sll_circular_create_#in~data|)) (<= 0 c_sll_circular_create_~head~0.offset) (= (select (select |c_#memory_int| c_sll_circular_create_~head~0.base) (+ c_sll_circular_create_~head~0.offset 4)) |c_sll_circular_create_#in~data|) (<= c_sll_circular_create_~last~0.offset 0)) is different from false [2021-11-19 05:10:54,547 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_sll_circular_create_#in~len| 4) (forall ((v_DerPreprocessor_1 Int) (sll_circular_create_~last~0.base Int)) (= (select (select (store |c_#memory_int| sll_circular_create_~last~0.base (store (select |c_#memory_int| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_DerPreprocessor_1)) c_sll_circular_create_~head~0.base) (+ c_sll_circular_create_~head~0.offset 4)) |c_sll_circular_create_#in~data|)) (<= 0 c_sll_circular_create_~head~0.offset) (= (select (select |c_#memory_int| c_sll_circular_create_~head~0.base) (+ c_sll_circular_create_~head~0.offset 4)) |c_sll_circular_create_#in~data|) (<= c_sll_circular_create_~last~0.offset 0)) is different from false [2021-11-19 05:10:55,874 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_sll_circular_create_~new_head~0.base) (+ c_sll_circular_create_~new_head~0.offset 4)) |c_sll_circular_create_#in~data|) (= c_sll_circular_create_~data |c_sll_circular_create_#in~data|) (<= c_sll_circular_create_~last~0.offset 0) (forall ((v_DerPreprocessor_1 Int) (sll_circular_create_~last~0.base Int)) (= (select (select (store |c_#memory_int| sll_circular_create_~last~0.base (store (select |c_#memory_int| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_DerPreprocessor_1)) c_sll_circular_create_~new_head~0.base) (+ c_sll_circular_create_~new_head~0.offset 4)) |c_sll_circular_create_#in~data|)) (<= 0 c_sll_circular_create_~new_head~0.offset) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(#NULL.base)| |c_#NULL.base|)) is different from false [2021-11-19 05:10:57,704 WARN L838 $PredicateComparison]: unable to prove that (and (= c_sll_circular_create_~data |c_sll_circular_create_#in~data|) (forall ((v_DerPreprocessor_1 Int) (sll_circular_create_~last~0.base Int)) (= (select (select (store |c_#memory_int| sll_circular_create_~last~0.base (store (select |c_#memory_int| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_DerPreprocessor_1)) c_sll_circular_create_~head~0.base) (+ c_sll_circular_create_~head~0.offset 4)) |c_sll_circular_create_#in~data|)) (<= 0 c_sll_circular_create_~head~0.offset) (= (select (select |c_#memory_int| c_sll_circular_create_~head~0.base) (+ c_sll_circular_create_~head~0.offset 4)) |c_sll_circular_create_#in~data|) (<= c_sll_circular_create_~last~0.offset 0)) is different from false [2021-11-19 05:10:59,707 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_1 Int) (sll_circular_create_~last~0.base Int)) (= (select (select (store |c_#memory_int| sll_circular_create_~last~0.base (store (select |c_#memory_int| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_DerPreprocessor_1)) c_sll_circular_create_~head~0.base) (+ c_sll_circular_create_~head~0.offset 4)) |c_sll_circular_create_#in~data|)) (<= 0 c_sll_circular_create_~head~0.offset) (= (select (select |c_#memory_int| c_sll_circular_create_~head~0.base) (+ c_sll_circular_create_~head~0.offset 4)) |c_sll_circular_create_#in~data|) (<= c_sll_circular_create_~last~0.offset 0)) is different from false [2021-11-19 05:11:00,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:11:00,246 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2021-11-19 05:11:00,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-19 05:11:00,247 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.740740740740741) internal successors, (74), 25 states have internal predecessors, (74), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2021-11-19 05:11:00,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 05:11:00,248 INFO L225 Difference]: With dead ends: 75 [2021-11-19 05:11:00,248 INFO L226 Difference]: Without dead ends: 71 [2021-11-19 05:11:00,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=273, Invalid=1833, Unknown=12, NotChecked=1188, Total=3306 [2021-11-19 05:11:00,251 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 152 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-19 05:11:00,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 77 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 669 Invalid, 0 Unknown, 127 Unchecked, 0.5s Time] [2021-11-19 05:11:00,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-11-19 05:11:00,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-11-19 05:11:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 65 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 05:11:00,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2021-11-19 05:11:00,258 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 36 [2021-11-19 05:11:00,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 05:11:00,259 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2021-11-19 05:11:00,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.740740740740741) internal successors, (74), 25 states have internal predecessors, (74), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-19 05:11:00,260 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2021-11-19 05:11:00,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 05:11:00,262 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 05:11:00,262 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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-19 05:11:00,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-19 05:11:00,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-19 05:11:00,487 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 20 more)] === [2021-11-19 05:11:00,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:00,488 INFO L85 PathProgramCache]: Analyzing trace with hash 798081134, now seen corresponding path program 1 times [2021-11-19 05:11:00,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:00,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176334199] [2021-11-19 05:11:00,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:00,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:00,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 05:11:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:00,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 05:11:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-19 05:11:01,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:11:01,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176334199] [2021-11-19 05:11:01,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176334199] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 05:11:01,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629746699] [2021-11-19 05:11:01,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:01,277 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 05:11:01,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 05:11:01,280 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 05:11:01,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-19 05:11:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:01,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-19 05:11:01,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 05:11:01,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-19 05:11:01,659 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-19 05:11:01,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-19 05:11:01,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 05:11:01,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-11-19 05:11:01,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 05:11:01,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-11-19 05:11:01,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 05:11:01,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-19 05:11:01,976 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-11-19 05:11:01,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2021-11-19 05:11:02,002 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-19 05:11:02,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2021-11-19 05:11:02,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 05:11:02,538 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-19 05:11:02,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 64 [2021-11-19 05:11:02,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 05:11:02,550 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-19 05:11:02,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 42 [2021-11-19 05:11:02,684 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-11-19 05:11:02,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 49 [2021-11-19 05:11:02,706 INFO L354 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2021-11-19 05:11:02,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2021-11-19 05:11:02,878 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-19 05:11:02,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 05:11:05,677 WARN L838 $PredicateComparison]: unable to prove that (forall ((sll_circular_create_~last~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~head~0.base)) c_sll_circular_create_~head~0.base) c_sll_circular_create_~head~0.offset))) (or (= (select |c_#valid| .cse0) 1) (and (= .cse0 c_sll_circular_create_~head~0.base) (= c_sll_circular_create_~head~0.offset (select (select (store |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~head~0.offset)) c_sll_circular_create_~head~0.base) c_sll_circular_create_~head~0.offset)))))) is different from false [2021-11-19 05:11:07,757 WARN L838 $PredicateComparison]: unable to prove that (forall ((sll_circular_create_~last~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~new_head~0.base)) c_sll_circular_create_~new_head~0.base) c_sll_circular_create_~new_head~0.offset))) (or (= (select |c_#valid| .cse0) 1) (and (= .cse0 c_sll_circular_create_~new_head~0.base) (= c_sll_circular_create_~new_head~0.offset (select (select (store |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~new_head~0.offset)) c_sll_circular_create_~new_head~0.base) c_sll_circular_create_~new_head~0.offset)))))) is different from false [2021-11-19 05:11:09,840 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 Int) (sll_circular_create_~last~0.base Int)) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| c_sll_circular_create_~new_head~0.base (store (select |c_#memory_$Pointer$.base| c_sll_circular_create_~new_head~0.base) (+ c_sll_circular_create_~new_head~0.offset 4) v_DerPreprocessor_5)))) (store .cse2 sll_circular_create_~last~0.base (store (select .cse2 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~new_head~0.base))) c_sll_circular_create_~new_head~0.base) c_sll_circular_create_~new_head~0.offset))) (or (= (select |c_#valid| .cse0) 1) (and (= .cse0 c_sll_circular_create_~new_head~0.base) (forall ((v_DerPreprocessor_4 Int)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| c_sll_circular_create_~new_head~0.base (store (select |c_#memory_$Pointer$.offset| c_sll_circular_create_~new_head~0.base) (+ c_sll_circular_create_~new_head~0.offset 4) v_DerPreprocessor_4)))) (store .cse1 sll_circular_create_~last~0.base (store (select .cse1 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~new_head~0.offset))) c_sll_circular_create_~new_head~0.base) c_sll_circular_create_~new_head~0.offset) c_sll_circular_create_~new_head~0.offset)))))) is different from false [2021-11-19 05:11:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 3 not checked. [2021-11-19 05:11:10,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629746699] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 05:11:10,277 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 05:11:10,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 38 [2021-11-19 05:11:10,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014528779] [2021-11-19 05:11:10,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 05:11:10,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-19 05:11:10,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:11:10,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-19 05:11:10,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1139, Unknown=3, NotChecked=210, Total=1482 [2021-11-19 05:11:10,281 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 39 states, 38 states have (on average 2.236842105263158) internal successors, (85), 34 states have internal predecessors, (85), 1 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-19 05:11:33,384 WARN L227 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 58 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 05:11:35,387 WARN L838 $PredicateComparison]: unable to prove that (and (= c_sll_circular_create_~new_head~0.offset 0) (forall ((sll_circular_create_~last~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~new_head~0.base)) c_sll_circular_create_~new_head~0.base) c_sll_circular_create_~new_head~0.offset))) (or (= (select |c_#valid| .cse0) 1) (and (= .cse0 c_sll_circular_create_~new_head~0.base) (= c_sll_circular_create_~new_head~0.offset (select (select (store |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~new_head~0.offset)) c_sll_circular_create_~new_head~0.base) c_sll_circular_create_~new_head~0.offset)))))) (= (select |c_#valid| (select (select |c_#memory_$Pointer$.base| c_sll_circular_create_~new_head~0.base) c_sll_circular_create_~new_head~0.offset)) 1) (= (select |c_#valid| c_sll_circular_create_~new_head~0.base) 1) (= c_sll_circular_create_~last~0.offset 0) (= (select (select |c_#memory_$Pointer$.offset| c_sll_circular_create_~new_head~0.base) c_sll_circular_create_~new_head~0.offset) 0)) is different from false [2021-11-19 05:11:37,391 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((sll_circular_create_~last~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~head~0.base)) c_sll_circular_create_~head~0.base) c_sll_circular_create_~head~0.offset))) (or (= (select |c_#valid| .cse0) 1) (and (= .cse0 c_sll_circular_create_~head~0.base) (= c_sll_circular_create_~head~0.offset (select (select (store |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~head~0.offset)) c_sll_circular_create_~head~0.base) c_sll_circular_create_~head~0.offset)))))) (= c_sll_circular_create_~head~0.offset 0) (= (select (select |c_#memory_$Pointer$.offset| c_sll_circular_create_~head~0.base) c_sll_circular_create_~head~0.offset) 0) (= (select |c_#valid| (select (select |c_#memory_$Pointer$.base| c_sll_circular_create_~head~0.base) c_sll_circular_create_~head~0.offset)) 1) (= (select |c_#valid| c_sll_circular_create_~head~0.base) 1) (= c_sll_circular_create_~last~0.offset 0)) is different from false [2021-11-19 05:11:39,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:11:39,932 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2021-11-19 05:11:39,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-19 05:11:39,933 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.236842105263158) internal successors, (85), 34 states have internal predecessors, (85), 1 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2021-11-19 05:11:39,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 05:11:39,935 INFO L225 Difference]: With dead ends: 103 [2021-11-19 05:11:39,935 INFO L226 Difference]: Without dead ends: 103 [2021-11-19 05:11:39,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 36.3s TimeCoverageRelationStatistics Valid=224, Invalid=1945, Unknown=13, NotChecked=470, Total=2652 [2021-11-19 05:11:39,938 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 154 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 490 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-19 05:11:39,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 126 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 598 Invalid, 0 Unknown, 490 Unchecked, 0.6s Time] [2021-11-19 05:11:39,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-11-19 05:11:39,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 80. [2021-11-19 05:11:39,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.296875) internal successors, (83), 74 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 05:11:39,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2021-11-19 05:11:39,945 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 45 [2021-11-19 05:11:39,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 05:11:39,945 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2021-11-19 05:11:39,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.236842105263158) internal successors, (85), 34 states have internal predecessors, (85), 1 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-19 05:11:39,946 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2021-11-19 05:11:39,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 05:11:39,948 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 05:11:39,948 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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-19 05:11:39,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-19 05:11:40,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-19 05:11:40,163 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 20 more)] === [2021-11-19 05:11:40,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:40,164 INFO L85 PathProgramCache]: Analyzing trace with hash 798081135, now seen corresponding path program 1 times [2021-11-19 05:11:40,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:40,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010870460] [2021-11-19 05:11:40,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:40,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:40,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 05:11:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:40,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 05:11:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-19 05:11:41,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:11:41,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010870460] [2021-11-19 05:11:41,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010870460] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 05:11:41,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009192270] [2021-11-19 05:11:41,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:41,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 05:11:41,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 05:11:41,044 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 05:11:41,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-19 05:11:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:41,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-19 05:11:41,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 05:11:41,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-19 05:11:41,366 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-19 05:11:41,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-19 05:11:41,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 05:11:41,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-11-19 05:11:41,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 05:11:41,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-19 05:11:41,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 05:11:41,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-11-19 05:11:41,746 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-11-19 05:11:41,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2021-11-19 05:11:41,764 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-19 05:11:41,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2021-11-19 05:11:43,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 05:11:43,201 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-19 05:11:43,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 71 [2021-11-19 05:11:43,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 05:11:43,213 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-19 05:11:43,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 65 [2021-11-19 05:11:43,394 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-11-19 05:11:43,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 60 [2021-11-19 05:11:43,414 INFO L354 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2021-11-19 05:11:43,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2021-11-19 05:11:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-19 05:11:43,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 05:11:46,792 WARN L838 $PredicateComparison]: unable to prove that (forall ((sll_circular_create_~last~0.base Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~head~0.base)) c_sll_circular_create_~head~0.base) c_sll_circular_create_~head~0.offset)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~head~0.offset)) c_sll_circular_create_~head~0.base) c_sll_circular_create_~head~0.offset))) (or (and (<= (+ .cse0 8) (select |c_#length| .cse1)) (<= 0 (+ .cse0 4))) (and (= .cse1 c_sll_circular_create_~head~0.base) (= c_sll_circular_create_~head~0.offset .cse0))))) is different from false [2021-11-19 05:11:48,960 WARN L838 $PredicateComparison]: unable to prove that (forall ((sll_circular_create_~last~0.base Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~new_head~0.base)) c_sll_circular_create_~new_head~0.base) c_sll_circular_create_~new_head~0.offset)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~new_head~0.offset)) c_sll_circular_create_~new_head~0.base) c_sll_circular_create_~new_head~0.offset))) (or (and (<= (+ .cse0 8) (select |c_#length| .cse1)) (<= 0 (+ .cse0 4))) (and (= .cse1 c_sll_circular_create_~new_head~0.base) (= c_sll_circular_create_~new_head~0.offset .cse0))))) is different from false [2021-11-19 05:11:51,100 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (sll_circular_create_~last~0.base Int)) (let ((.cse3 (+ c_sll_circular_create_~new_head~0.offset 4))) (let ((.cse1 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| c_sll_circular_create_~new_head~0.base (store (select |c_#memory_$Pointer$.offset| c_sll_circular_create_~new_head~0.base) .cse3 v_DerPreprocessor_9)))) (store .cse4 sll_circular_create_~last~0.base (store (select .cse4 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~new_head~0.offset))) c_sll_circular_create_~new_head~0.base) c_sll_circular_create_~new_head~0.offset)) (.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| c_sll_circular_create_~new_head~0.base (store (select |c_#memory_$Pointer$.base| c_sll_circular_create_~new_head~0.base) .cse3 v_DerPreprocessor_8)))) (store .cse2 sll_circular_create_~last~0.base (store (select .cse2 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~new_head~0.base))) c_sll_circular_create_~new_head~0.base) c_sll_circular_create_~new_head~0.offset))) (or (and (= .cse0 c_sll_circular_create_~new_head~0.base) (= c_sll_circular_create_~new_head~0.offset .cse1)) (and (<= 0 (+ .cse1 4)) (<= (+ .cse1 8) (select |c_#length| .cse0))))))) is different from false [2021-11-19 05:11:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 3 not checked. [2021-11-19 05:11:51,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009192270] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 05:11:51,938 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 05:11:51,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 39 [2021-11-19 05:11:51,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684691227] [2021-11-19 05:11:51,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 05:11:51,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-19 05:11:51,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:11:51,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-19 05:11:51,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1204, Unknown=3, NotChecked=216, Total=1560 [2021-11-19 05:11:51,942 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 35 states have internal predecessors, (86), 1 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-19 05:11:54,553 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#length| c_sll_circular_create_~head~0.base) 8) (= c_sll_circular_create_~head~0.offset 0) (= c_sll_circular_create_~new_head~0.offset 0) (forall ((v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (sll_circular_create_~last~0.base Int)) (let ((.cse3 (+ c_sll_circular_create_~new_head~0.offset 4))) (let ((.cse1 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| c_sll_circular_create_~new_head~0.base (store (select |c_#memory_$Pointer$.offset| c_sll_circular_create_~new_head~0.base) .cse3 v_DerPreprocessor_9)))) (store .cse4 sll_circular_create_~last~0.base (store (select .cse4 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~new_head~0.offset))) c_sll_circular_create_~new_head~0.base) c_sll_circular_create_~new_head~0.offset)) (.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| c_sll_circular_create_~new_head~0.base (store (select |c_#memory_$Pointer$.base| c_sll_circular_create_~new_head~0.base) .cse3 v_DerPreprocessor_8)))) (store .cse2 sll_circular_create_~last~0.base (store (select .cse2 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~new_head~0.base))) c_sll_circular_create_~new_head~0.base) c_sll_circular_create_~new_head~0.offset))) (or (and (= .cse0 c_sll_circular_create_~new_head~0.base) (= c_sll_circular_create_~new_head~0.offset .cse1)) (and (<= 0 (+ .cse1 4)) (<= (+ .cse1 8) (select |c_#length| .cse0))))))) (= (select |c_#length| (select (select |c_#memory_$Pointer$.base| c_sll_circular_create_~new_head~0.base) c_sll_circular_create_~new_head~0.offset)) 8) (= 8 (select |c_#length| c_sll_circular_create_~new_head~0.base)) (= c_sll_circular_create_~last~0.offset 0) (= (select (select |c_#memory_$Pointer$.offset| c_sll_circular_create_~new_head~0.base) c_sll_circular_create_~new_head~0.offset) 0) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(#NULL.base)| |c_#NULL.base|)) is different from false [2021-11-19 05:11:56,557 WARN L838 $PredicateComparison]: unable to prove that (and (= c_sll_circular_create_~new_head~0.offset 0) (= (select |c_#length| (select (select |c_#memory_$Pointer$.base| c_sll_circular_create_~new_head~0.base) c_sll_circular_create_~new_head~0.offset)) 8) (= 8 (select |c_#length| c_sll_circular_create_~new_head~0.base)) (forall ((sll_circular_create_~last~0.base Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~new_head~0.base)) c_sll_circular_create_~new_head~0.base) c_sll_circular_create_~new_head~0.offset)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~new_head~0.offset)) c_sll_circular_create_~new_head~0.base) c_sll_circular_create_~new_head~0.offset))) (or (and (<= (+ .cse0 8) (select |c_#length| .cse1)) (<= 0 (+ .cse0 4))) (and (= .cse1 c_sll_circular_create_~new_head~0.base) (= c_sll_circular_create_~new_head~0.offset .cse0))))) (= c_sll_circular_create_~last~0.offset 0) (= (select (select |c_#memory_$Pointer$.offset| c_sll_circular_create_~new_head~0.base) c_sll_circular_create_~new_head~0.offset) 0)) is different from false [2021-11-19 05:11:58,561 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((sll_circular_create_~last~0.base Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~head~0.base)) c_sll_circular_create_~head~0.base) c_sll_circular_create_~head~0.offset)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~head~0.offset)) c_sll_circular_create_~head~0.base) c_sll_circular_create_~head~0.offset))) (or (and (<= (+ .cse0 8) (select |c_#length| .cse1)) (<= 0 (+ .cse0 4))) (and (= .cse1 c_sll_circular_create_~head~0.base) (= c_sll_circular_create_~head~0.offset .cse0))))) (= (select |c_#length| c_sll_circular_create_~head~0.base) 8) (= c_sll_circular_create_~head~0.offset 0) (= (select (select |c_#memory_$Pointer$.offset| c_sll_circular_create_~head~0.base) c_sll_circular_create_~head~0.offset) 0) (= (select |c_#length| (select (select |c_#memory_$Pointer$.base| c_sll_circular_create_~head~0.base) c_sll_circular_create_~head~0.offset)) 8) (= c_sll_circular_create_~last~0.offset 0)) is different from false [2021-11-19 05:11:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:11:59,181 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2021-11-19 05:11:59,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-19 05:11:59,182 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 35 states have internal predecessors, (86), 1 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2021-11-19 05:11:59,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 05:11:59,183 INFO L225 Difference]: With dead ends: 101 [2021-11-19 05:11:59,184 INFO L226 Difference]: Without dead ends: 101 [2021-11-19 05:11:59,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=230, Invalid=2044, Unknown=6, NotChecked=582, Total=2862 [2021-11-19 05:11:59,186 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 156 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 318 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-19 05:11:59,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 126 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 801 Invalid, 0 Unknown, 318 Unchecked, 0.8s Time] [2021-11-19 05:11:59,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-11-19 05:11:59,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 80. [2021-11-19 05:11:59,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.25) internal successors, (80), 74 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 05:11:59,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2021-11-19 05:11:59,193 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 45 [2021-11-19 05:11:59,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 05:11:59,194 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2021-11-19 05:11:59,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 35 states have internal predecessors, (86), 1 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-19 05:11:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2021-11-19 05:11:59,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-19 05:11:59,196 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 05:11:59,196 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 05:11:59,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-19 05:11:59,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-19 05:11:59,408 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr13ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 20 more)] === [2021-11-19 05:11:59,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:59,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1843176256, now seen corresponding path program 1 times [2021-11-19 05:11:59,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:59,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127044340] [2021-11-19 05:11:59,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:59,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:59,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-19 05:11:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:59,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-19 05:11:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:12:00,661 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-19 05:12:00,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:12:00,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127044340] [2021-11-19 05:12:00,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127044340] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 05:12:00,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625948067] [2021-11-19 05:12:00,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:12:00,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 05:12:00,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 05:12:00,675 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 05:12:00,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654b9155-c992-463d-b2e1-59df7109b574/bin/uautomizer-ZXIjhQolGL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-19 05:12:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:12:00,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 61 conjunts are in the unsatisfiable core [2021-11-19 05:12:00,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 05:12:01,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-19 05:12:01,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2021-11-19 05:12:01,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-11-19 05:12:01,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 05:12:01,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 05:12:01,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2021-11-19 05:12:01,535 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 05:12:01,548 INFO L354 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2021-11-19 05:12:01,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-11-19 05:12:01,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 05:12:01,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-19 05:12:01,772 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-11-19 05:12:01,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 68 [2021-11-19 05:12:01,791 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-19 05:12:01,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 67 [2021-11-19 05:12:01,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 05:12:01,799 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 05:12:01,803 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-19 05:12:01,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 55 [2021-11-19 05:12:02,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 05:12:02,518 INFO L354 Elim1Store]: treesize reduction 88, result has 23.5 percent of original size [2021-11-19 05:12:02,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 106 [2021-11-19 05:12:02,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 05:12:02,541 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-19 05:12:02,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 65 [2021-11-19 05:12:02,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 05:12:02,553 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-19 05:12:02,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 59 [2021-11-19 05:12:02,767 INFO L354 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2021-11-19 05:12:02,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 53 [2021-11-19 05:12:02,786 INFO L354 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2021-11-19 05:12:02,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 32 [2021-11-19 05:12:03,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-19 05:12:03,131 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-19 05:12:03,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 05:12:04,672 INFO L354 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2021-11-19 05:12:04,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 212 treesize of output 1 [2021-11-19 05:12:07,088 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (main_~data_new~0 Int) (v_DerPreprocessor_10 Int) (sll_circular_create_~last~0.base Int)) (let ((.cse1 (+ c_sll_circular_create_~head~0.offset 4))) (let ((.cse3 (select (store (select (store |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~head~0.offset)) c_sll_circular_create_~head~0.base) .cse1 v_DerPreprocessor_11) c_sll_circular_create_~head~0.offset)) (.cse2 (select (store (select (store |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~head~0.base)) c_sll_circular_create_~head~0.base) .cse1 v_DerPreprocessor_10) c_sll_circular_create_~head~0.offset))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| sll_circular_create_~last~0.base (store (select |c_#memory_int| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_DerPreprocessor_13)))) (store .cse0 c_sll_circular_create_~head~0.base (store (select .cse0 c_sll_circular_create_~head~0.base) .cse1 main_~data_new~0))) .cse2) (+ .cse3 4)) |c_sll_circular_create_#in~data|) (and (= .cse3 c_sll_circular_create_~head~0.offset) (= c_sll_circular_create_~head~0.base .cse2)))))) is different from false [2021-11-19 05:12:09,233 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (main_~data_new~0 Int) (v_DerPreprocessor_10 Int) (sll_circular_create_~last~0.base Int)) (let ((.cse3 (+ c_sll_circular_create_~new_head~0.offset 4))) (let ((.cse1 (select (store (select (store |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~new_head~0.base)) c_sll_circular_create_~new_head~0.base) .cse3 v_DerPreprocessor_10) c_sll_circular_create_~new_head~0.offset)) (.cse0 (select (store (select (store |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~new_head~0.offset)) c_sll_circular_create_~new_head~0.base) .cse3 v_DerPreprocessor_11) c_sll_circular_create_~new_head~0.offset))) (or (and (= .cse0 c_sll_circular_create_~new_head~0.offset) (= c_sll_circular_create_~new_head~0.base .cse1)) (= (select (select (let ((.cse2 (store |c_#memory_int| sll_circular_create_~last~0.base (store (select |c_#memory_int| sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_DerPreprocessor_13)))) (store .cse2 c_sll_circular_create_~new_head~0.base (store (select .cse2 c_sll_circular_create_~new_head~0.base) .cse3 main_~data_new~0))) .cse1) (+ .cse0 4)) |c_sll_circular_create_#in~data|))))) is different from false [2021-11-19 05:12:11,348 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_15 Int) (main_~data_new~0 Int) (v_DerPreprocessor_10 Int) (sll_circular_create_~last~0.base Int)) (let ((.cse3 (+ c_sll_circular_create_~new_head~0.offset 4))) (let ((.cse1 (select (store (select (let ((.cse6 (store |c_#memory_$Pointer$.base| c_sll_circular_create_~new_head~0.base (store (select |c_#memory_$Pointer$.base| c_sll_circular_create_~new_head~0.base) .cse3 v_DerPreprocessor_14)))) (store .cse6 sll_circular_create_~last~0.base (store (select .cse6 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~new_head~0.base))) c_sll_circular_create_~new_head~0.base) .cse3 v_DerPreprocessor_10) c_sll_circular_create_~new_head~0.offset)) (.cse0 (select (store (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| c_sll_circular_create_~new_head~0.base (store (select |c_#memory_$Pointer$.offset| c_sll_circular_create_~new_head~0.base) .cse3 v_DerPreprocessor_15)))) (store .cse5 sll_circular_create_~last~0.base (store (select .cse5 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset c_sll_circular_create_~new_head~0.offset))) c_sll_circular_create_~new_head~0.base) .cse3 v_DerPreprocessor_11) c_sll_circular_create_~new_head~0.offset))) (or (and (= .cse0 c_sll_circular_create_~new_head~0.offset) (= .cse1 c_sll_circular_create_~new_head~0.base)) (= (select (select (let ((.cse2 (let ((.cse4 (store |c_#memory_int| c_sll_circular_create_~new_head~0.base (store (select |c_#memory_int| c_sll_circular_create_~new_head~0.base) .cse3 c_sll_circular_create_~data)))) (store .cse4 sll_circular_create_~last~0.base (store (select .cse4 sll_circular_create_~last~0.base) c_sll_circular_create_~last~0.offset v_DerPreprocessor_13))))) (store .cse2 c_sll_circular_create_~new_head~0.base (store (select .cse2 c_sll_circular_create_~new_head~0.base) .cse3 main_~data_new~0))) .cse1) (+ .cse0 4)) |c_sll_circular_create_#in~data|))))) is different from false [2021-11-19 05:12:11,473 INFO L354 Elim1Store]: treesize reduction 73, result has 34.8 percent of original size [2021-11-19 05:12:11,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 237 [2021-11-19 05:12:11,492 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 05:12:11,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 333 treesize of output 279 [2021-11-19 05:12:11,579 INFO L354 Elim1Store]: treesize reduction 87, result has 34.1 percent of original size [2021-11-19 05:12:11,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 275 treesize of output 235 [2021-11-19 05:12:11,595 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 05:12:11,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 227 [2021-11-19 05:12:11,752 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 05:12:11,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 122 [2021-11-19 05:12:11,845 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 05:12:11,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 119 [2021-11-19 05:12:12,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 98 [2021-11-19 05:12:12,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 105 [2021-11-19 05:12:12,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 108 [2021-11-19 05:12:12,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 115 [2021-11-19 05:12:13,284 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 05:12:13,550 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 05:12:13,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 673 treesize of output 619 [2021-11-19 05:12:14,400 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 05:12:14,602 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 05:12:14,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 588 treesize of output 580