./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:07:42,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:07:42,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:07:42,917 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:07:42,918 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:07:42,919 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:07:42,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:07:42,923 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:07:42,925 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:07:42,926 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:07:42,927 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:07:42,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:07:42,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:07:42,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:07:42,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:07:42,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:07:42,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:07:42,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:07:42,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:07:42,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:07:42,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:07:42,942 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:07:42,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:07:42,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:07:42,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:07:42,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:07:42,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:07:42,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:07:42,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:07:42,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:07:42,951 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:07:42,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:07:42,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:07:42,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:07:42,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:07:42,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:07:42,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:07:42,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:07:42,955 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:07:42,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:07:42,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:07:42,956 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-06 17:07:42,976 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:07:42,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:07:42,976 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:07:42,976 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:07:42,977 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:07:42,977 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:07:42,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:07:42,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:07:42,978 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:07:42,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:07:42,978 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:07:42,978 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 17:07:42,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 17:07:42,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:07:42,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:07:42,979 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-06 17:07:42,979 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-06 17:07:42,979 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-06 17:07:42,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:07:42,979 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 17:07:42,980 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:07:42,980 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:07:42,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:07:42,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:07:42,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:07:42,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:07:42,980 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:07:42,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:07:42,980 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 17:07:42,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 17:07:42,981 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:07:42,981 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_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2021-12-06 17:07:43,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:07:43,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:07:43,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:07:43,175 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:07:43,175 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:07:43,176 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2021-12-06 17:07:43,218 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/data/3645551e4/23226107164e49ad8e51141dbfa5f0e7/FLAG3e73c5a45 [2021-12-06 17:07:43,659 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:07:43,659 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2021-12-06 17:07:43,671 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/data/3645551e4/23226107164e49ad8e51141dbfa5f0e7/FLAG3e73c5a45 [2021-12-06 17:07:43,682 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/data/3645551e4/23226107164e49ad8e51141dbfa5f0e7 [2021-12-06 17:07:43,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:07:43,685 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:07:43,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:07:43,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:07:43,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:07:43,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:07:43" (1/1) ... [2021-12-06 17:07:43,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51351327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:43, skipping insertion in model container [2021-12-06 17:07:43,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:07:43" (1/1) ... [2021-12-06 17:07:43,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:07:43,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:07:43,911 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_e7ff5680-3a39-45ce-909f-6401cbc1f059/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2021-12-06 17:07:43,913 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:07:43,919 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:07:43,951 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_e7ff5680-3a39-45ce-909f-6401cbc1f059/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2021-12-06 17:07:43,951 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:07:43,972 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:07:43,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:43 WrapperNode [2021-12-06 17:07:43,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:07:43,974 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:07:43,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:07:43,974 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:07:43,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:43" (1/1) ... [2021-12-06 17:07:43,994 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:43" (1/1) ... [2021-12-06 17:07:44,015 INFO L137 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2021-12-06 17:07:44,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:07:44,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:07:44,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:07:44,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:07:44,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:43" (1/1) ... [2021-12-06 17:07:44,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:43" (1/1) ... [2021-12-06 17:07:44,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:43" (1/1) ... [2021-12-06 17:07:44,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:43" (1/1) ... [2021-12-06 17:07:44,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:43" (1/1) ... [2021-12-06 17:07:44,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:43" (1/1) ... [2021-12-06 17:07:44,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:43" (1/1) ... [2021-12-06 17:07:44,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:07:44,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:07:44,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:07:44,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:07:44,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:43" (1/1) ... [2021-12-06 17:07:44,048 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:07:44,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:07:44,068 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 17:07:44,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 17:07:44,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 17:07:44,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 17:07:44,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 17:07:44,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:07:44,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 17:07:44,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 17:07:44,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 17:07:44,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 17:07:44,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:07:44,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:07:44,171 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:07:44,173 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:07:44,343 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:07:44,348 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:07:44,348 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-06 17:07:44,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:07:44 BoogieIcfgContainer [2021-12-06 17:07:44,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:07:44,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 17:07:44,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 17:07:44,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 17:07:44,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:07:43" (1/3) ... [2021-12-06 17:07:44,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe8457d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:07:44, skipping insertion in model container [2021-12-06 17:07:44,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:43" (2/3) ... [2021-12-06 17:07:44,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe8457d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:07:44, skipping insertion in model container [2021-12-06 17:07:44,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:07:44" (3/3) ... [2021-12-06 17:07:44,355 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2021-12-06 17:07:44,359 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 17:07:44,359 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2021-12-06 17:07:44,391 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 17:07:44,396 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 17:07:44,397 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2021-12-06 17:07:44,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-06 17:07:44,413 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:07:44,413 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-06 17:07:44,414 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:07:44,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:07:44,418 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2021-12-06 17:07:44,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:07:44,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228073347] [2021-12-06 17:07:44,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:44,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:07:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:07:44,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:07:44,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228073347] [2021-12-06 17:07:44,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228073347] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:07:44,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:07:44,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:07:44,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37572856] [2021-12-06 17:07:44,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:07:44,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:07:44,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:07:44,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:07:44,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:07:44,594 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:44,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:07:44,667 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2021-12-06 17:07:44,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:07:44,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-06 17:07:44,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:07:44,679 INFO L225 Difference]: With dead ends: 109 [2021-12-06 17:07:44,679 INFO L226 Difference]: Without dead ends: 104 [2021-12-06 17:07:44,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:07:44,684 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 63 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:07:44,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 133 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:07:44,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-06 17:07:44,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2021-12-06 17:07:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.6) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2021-12-06 17:07:44,720 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 5 [2021-12-06 17:07:44,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:07:44,720 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2021-12-06 17:07:44,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2021-12-06 17:07:44,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-06 17:07:44,721 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:07:44,721 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-06 17:07:44,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 17:07:44,728 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:07:44,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:07:44,729 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2021-12-06 17:07:44,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:07:44,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578342923] [2021-12-06 17:07:44,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:44,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:07:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:07:44,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:07:44,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578342923] [2021-12-06 17:07:44,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578342923] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:07:44,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:07:44,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:07:44,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844680839] [2021-12-06 17:07:44,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:07:44,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:07:44,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:07:44,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:07:44,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:07:44,781 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:44,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:07:44,827 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2021-12-06 17:07:44,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:07:44,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-06 17:07:44,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:07:44,829 INFO L225 Difference]: With dead ends: 102 [2021-12-06 17:07:44,829 INFO L226 Difference]: Without dead ends: 102 [2021-12-06 17:07:44,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:07:44,830 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 58 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:07:44,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:07:44,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-06 17:07:44,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 57. [2021-12-06 17:07:44,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.55) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:44,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2021-12-06 17:07:44,836 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 5 [2021-12-06 17:07:44,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:07:44,836 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2021-12-06 17:07:44,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:44,837 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2021-12-06 17:07:44,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-06 17:07:44,837 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:07:44,837 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:07:44,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 17:07:44,837 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:07:44,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:07:44,838 INFO L85 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2021-12-06 17:07:44,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:07:44,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611721268] [2021-12-06 17:07:44,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:44,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:07:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:44,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:07:44,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:07:44,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611721268] [2021-12-06 17:07:44,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611721268] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:07:44,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:07:44,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:07:44,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940767774] [2021-12-06 17:07:44,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:07:44,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:07:44,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:07:44,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:07:44,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:07:44,868 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:44,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:07:44,877 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2021-12-06 17:07:44,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:07:44,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-06 17:07:44,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:07:44,879 INFO L225 Difference]: With dead ends: 68 [2021-12-06 17:07:44,879 INFO L226 Difference]: Without dead ends: 68 [2021-12-06 17:07:44,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:07:44,881 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:07:44,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:07:44,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-06 17:07:44,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2021-12-06 17:07:44,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:44,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2021-12-06 17:07:44,888 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 8 [2021-12-06 17:07:44,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:07:44,888 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2021-12-06 17:07:44,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:44,888 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2021-12-06 17:07:44,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-06 17:07:44,889 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:07:44,889 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:07:44,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 17:07:44,889 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:07:44,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:07:44,890 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2021-12-06 17:07:44,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:07:44,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640890860] [2021-12-06 17:07:44,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:44,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:07:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:07:44,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:07:44,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640890860] [2021-12-06 17:07:44,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640890860] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:07:44,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:07:44,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:07:44,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016479579] [2021-12-06 17:07:44,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:07:44,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:07:44,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:07:44,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:07:44,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:07:44,933 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:44,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:07:44,995 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2021-12-06 17:07:44,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:07:44,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-06 17:07:44,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:07:44,997 INFO L225 Difference]: With dead ends: 76 [2021-12-06 17:07:44,997 INFO L226 Difference]: Without dead ends: 76 [2021-12-06 17:07:44,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:07:44,999 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 164 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:07:44,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 67 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:07:45,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-06 17:07:45,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2021-12-06 17:07:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2021-12-06 17:07:45,005 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 9 [2021-12-06 17:07:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:07:45,005 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2021-12-06 17:07:45,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:45,005 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2021-12-06 17:07:45,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-06 17:07:45,006 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:07:45,006 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:07:45,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 17:07:45,006 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:07:45,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:07:45,007 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2021-12-06 17:07:45,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:07:45,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166199468] [2021-12-06 17:07:45,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:45,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:07:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:07:45,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:07:45,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166199468] [2021-12-06 17:07:45,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166199468] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:07:45,064 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:07:45,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:07:45,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464264968] [2021-12-06 17:07:45,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:07:45,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:07:45,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:07:45,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:07:45,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:07:45,065 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:45,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:07:45,117 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2021-12-06 17:07:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:07:45,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-06 17:07:45,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:07:45,118 INFO L225 Difference]: With dead ends: 61 [2021-12-06 17:07:45,118 INFO L226 Difference]: Without dead ends: 61 [2021-12-06 17:07:45,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:07:45,119 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 163 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:07:45,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 45 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:07:45,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-06 17:07:45,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2021-12-06 17:07:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:45,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2021-12-06 17:07:45,123 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2021-12-06 17:07:45,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:07:45,123 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2021-12-06 17:07:45,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2021-12-06 17:07:45,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-06 17:07:45,124 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:07:45,124 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:07:45,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 17:07:45,124 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:07:45,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:07:45,124 INFO L85 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2021-12-06 17:07:45,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:07:45,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692587980] [2021-12-06 17:07:45,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:45,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:07:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:45,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:07:45,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:07:45,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692587980] [2021-12-06 17:07:45,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692587980] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:07:45,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105526290] [2021-12-06 17:07:45,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:45,173 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:07:45,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:07:45,174 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:07:45,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 17:07:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:45,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 17:07:45,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:07:45,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:07:45,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:07:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:07:45,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105526290] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:07:45,327 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:07:45,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-06 17:07:45,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293507120] [2021-12-06 17:07:45,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:07:45,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:07:45,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:07:45,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:07:45,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:07:45,334 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:45,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:07:45,344 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2021-12-06 17:07:45,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 17:07:45,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-06 17:07:45,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:07:45,345 INFO L225 Difference]: With dead ends: 65 [2021-12-06 17:07:45,345 INFO L226 Difference]: Without dead ends: 65 [2021-12-06 17:07:45,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:07:45,346 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:07:45,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 163 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:07:45,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-06 17:07:45,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-06 17:07:45,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.4) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:45,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2021-12-06 17:07:45,350 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 17 [2021-12-06 17:07:45,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:07:45,350 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2021-12-06 17:07:45,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:45,351 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2021-12-06 17:07:45,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 17:07:45,351 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:07:45,351 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:07:45,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 17:07:45,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:07:45,553 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:07:45,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:07:45,555 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 2 times [2021-12-06 17:07:45,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:07:45,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560582693] [2021-12-06 17:07:45,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:45,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:07:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 17:07:45,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:07:45,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560582693] [2021-12-06 17:07:45,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560582693] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:07:45,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:07:45,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:07:45,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360895385] [2021-12-06 17:07:45,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:07:45,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:07:45,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:07:45,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:07:45,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:07:45,749 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:07:45,898 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2021-12-06 17:07:45,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:07:45,899 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-06 17:07:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:07:45,900 INFO L225 Difference]: With dead ends: 116 [2021-12-06 17:07:45,900 INFO L226 Difference]: Without dead ends: 116 [2021-12-06 17:07:45,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:07:45,901 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 379 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:07:45,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 141 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:07:45,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-06 17:07:45,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 68. [2021-12-06 17:07:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2021-12-06 17:07:45,906 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 26 [2021-12-06 17:07:45,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:07:45,906 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2021-12-06 17:07:45,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:45,906 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2021-12-06 17:07:45,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 17:07:45,907 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:07:45,907 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:07:45,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 17:07:45,907 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:07:45,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:07:45,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913171, now seen corresponding path program 1 times [2021-12-06 17:07:45,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:07:45,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049915930] [2021-12-06 17:07:45,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:45,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:07:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:45,957 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-06 17:07:45,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:07:45,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049915930] [2021-12-06 17:07:45,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049915930] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:07:45,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:07:45,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:07:45,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464983682] [2021-12-06 17:07:45,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:07:45,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:07:45,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:07:45,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:07:45,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:07:45,960 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:45,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:07:45,987 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2021-12-06 17:07:45,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:07:45,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-06 17:07:45,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:07:45,988 INFO L225 Difference]: With dead ends: 96 [2021-12-06 17:07:45,988 INFO L226 Difference]: Without dead ends: 96 [2021-12-06 17:07:45,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:07:45,989 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 78 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:07:45,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 151 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:07:45,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-06 17:07:45,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2021-12-06 17:07:45,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 70 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2021-12-06 17:07:45,996 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 26 [2021-12-06 17:07:45,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:07:45,996 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2021-12-06 17:07:45,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2021-12-06 17:07:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 17:07:45,997 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:07:45,997 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:07:45,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 17:07:45,997 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:07:45,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:07:45,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913226, now seen corresponding path program 1 times [2021-12-06 17:07:45,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:07:45,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957647788] [2021-12-06 17:07:45,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:45,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:07:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:46,112 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 17:07:46,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:07:46,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957647788] [2021-12-06 17:07:46,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957647788] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:07:46,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:07:46,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:07:46,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578998443] [2021-12-06 17:07:46,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:07:46,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:07:46,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:07:46,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:07:46,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:07:46,114 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:46,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:07:46,294 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2021-12-06 17:07:46,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:07:46,294 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-06 17:07:46,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:07:46,295 INFO L225 Difference]: With dead ends: 107 [2021-12-06 17:07:46,295 INFO L226 Difference]: Without dead ends: 107 [2021-12-06 17:07:46,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:07:46,296 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 365 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:07:46,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 106 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:07:46,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-06 17:07:46,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 71. [2021-12-06 17:07:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.375) internal successors, (77), 70 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2021-12-06 17:07:46,300 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 26 [2021-12-06 17:07:46,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:07:46,300 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2021-12-06 17:07:46,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:46,300 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2021-12-06 17:07:46,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-06 17:07:46,301 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:07:46,301 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:07:46,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 17:07:46,301 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:07:46,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:07:46,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2021-12-06 17:07:46,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:07:46,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257149346] [2021-12-06 17:07:46,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:46,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:07:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:46,493 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:07:46,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:07:46,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257149346] [2021-12-06 17:07:46,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257149346] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:07:46,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925572207] [2021-12-06 17:07:46,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:46,494 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:07:46,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:07:46,495 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:07:46,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 17:07:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:46,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-06 17:07:46,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:07:46,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:07:46,622 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:07:46,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-06 17:07:46,682 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-12-06 17:07:46,778 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 21 treesize of output 9 [2021-12-06 17:07:46,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:07:46,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:07:46,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:07:46,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925572207] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:07:46,972 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:07:46,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 33 [2021-12-06 17:07:46,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074291227] [2021-12-06 17:07:46,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:07:46,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-06 17:07:46,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:07:46,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-06 17:07:46,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1002, Unknown=0, NotChecked=0, Total=1122 [2021-12-06 17:07:46,973 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:47,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:07:47,641 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2021-12-06 17:07:47,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-06 17:07:47,642 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-06 17:07:47,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:07:47,643 INFO L225 Difference]: With dead ends: 105 [2021-12-06 17:07:47,643 INFO L226 Difference]: Without dead ends: 105 [2021-12-06 17:07:47,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2021-12-06 17:07:47,645 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 750 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:07:47,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [750 Valid, 610 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:07:47,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-06 17:07:47,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2021-12-06 17:07:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:47,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2021-12-06 17:07:47,649 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 29 [2021-12-06 17:07:47,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:07:47,650 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2021-12-06 17:07:47,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:47,650 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2021-12-06 17:07:47,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-06 17:07:47,650 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:07:47,651 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:07:47,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 17:07:47,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:07:47,851 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:07:47,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:07:47,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687585, now seen corresponding path program 1 times [2021-12-06 17:07:47,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:07:47,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892259327] [2021-12-06 17:07:47,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:47,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:07:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:07:48,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:07:48,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892259327] [2021-12-06 17:07:48,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892259327] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:07:48,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243413236] [2021-12-06 17:07:48,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:48,097 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:07:48,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:07:48,098 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:07:48,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 17:07:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:48,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-06 17:07:48,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:07:48,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:07:48,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:07:48,278 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:07:48,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:07:48,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-06 17:07:48,368 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-12-06 17:07:48,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:07:48,517 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 31 treesize of output 13 [2021-12-06 17:07:48,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 17:07:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:07:48,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:07:49,076 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:07:49,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243413236] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:07:49,077 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:07:49,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 13] total 39 [2021-12-06 17:07:49,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922075508] [2021-12-06 17:07:49,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:07:49,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-06 17:07:49,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:07:49,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-06 17:07:49,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1450, Unknown=0, NotChecked=0, Total=1560 [2021-12-06 17:07:49,080 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 40 states, 39 states have (on average 2.051282051282051) internal successors, (80), 40 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:51,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:07:51,167 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2021-12-06 17:07:51,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-06 17:07:51,167 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.051282051282051) internal successors, (80), 40 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-06 17:07:51,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:07:51,169 INFO L225 Difference]: With dead ends: 213 [2021-12-06 17:07:51,169 INFO L226 Difference]: Without dead ends: 213 [2021-12-06 17:07:51,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=765, Invalid=3267, Unknown=0, NotChecked=0, Total=4032 [2021-12-06 17:07:51,171 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 2637 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2637 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 17:07:51,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2637 Valid, 708 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 894 Invalid, 0 Unknown, 92 Unchecked, 0.5s Time] [2021-12-06 17:07:51,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-06 17:07:51,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 84. [2021-12-06 17:07:51,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.391304347826087) internal successors, (96), 83 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2021-12-06 17:07:51,177 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 29 [2021-12-06 17:07:51,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:07:51,178 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2021-12-06 17:07:51,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.051282051282051) internal successors, (80), 40 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:51,178 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2021-12-06 17:07:51,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-06 17:07:51,179 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:07:51,179 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:07:51,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 17:07:51,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-06 17:07:51,381 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:07:51,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:07:51,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1082686446, now seen corresponding path program 2 times [2021-12-06 17:07:51,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:07:51,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349415130] [2021-12-06 17:07:51,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:51,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:07:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-06 17:07:51,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:07:51,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349415130] [2021-12-06 17:07:51,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349415130] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:07:51,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:07:51,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:07:51,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198004316] [2021-12-06 17:07:51,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:07:51,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:07:51,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:07:51,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:07:51,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:07:51,423 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:51,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:07:51,444 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2021-12-06 17:07:51,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:07:51,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-06 17:07:51,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:07:51,445 INFO L225 Difference]: With dead ends: 70 [2021-12-06 17:07:51,445 INFO L226 Difference]: Without dead ends: 70 [2021-12-06 17:07:51,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:07:51,446 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 114 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:07:51,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 73 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:07:51,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-06 17:07:51,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-12-06 17:07:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.293103448275862) internal successors, (75), 69 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2021-12-06 17:07:51,449 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 32 [2021-12-06 17:07:51,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:07:51,450 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2021-12-06 17:07:51,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2021-12-06 17:07:51,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 17:07:51,451 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:07:51,451 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:07:51,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 17:07:51,451 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:07:51,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:07:51,452 INFO L85 PathProgramCache]: Analyzing trace with hash -516260032, now seen corresponding path program 1 times [2021-12-06 17:07:51,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:07:51,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823620171] [2021-12-06 17:07:51,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:51,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:07:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 17:07:51,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:07:51,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823620171] [2021-12-06 17:07:51,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823620171] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:07:51,516 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:07:51,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:07:51,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105659702] [2021-12-06 17:07:51,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:07:51,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:07:51,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:07:51,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:07:51,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:07:51,518 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:51,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:07:51,642 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2021-12-06 17:07:51,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:07:51,643 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-06 17:07:51,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:07:51,643 INFO L225 Difference]: With dead ends: 89 [2021-12-06 17:07:51,643 INFO L226 Difference]: Without dead ends: 89 [2021-12-06 17:07:51,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:07:51,644 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 337 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:07:51,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 109 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:07:51,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-06 17:07:51,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2021-12-06 17:07:51,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 72 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:51,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2021-12-06 17:07:51,648 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 36 [2021-12-06 17:07:51,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:07:51,648 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2021-12-06 17:07:51,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:51,648 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2021-12-06 17:07:51,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 17:07:51,649 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:07:51,649 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:07:51,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 17:07:51,650 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:07:51,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:07:51,650 INFO L85 PathProgramCache]: Analyzing trace with hash -516260031, now seen corresponding path program 1 times [2021-12-06 17:07:51,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:07:51,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587831033] [2021-12-06 17:07:51,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:51,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:07:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:51,697 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 17:07:51,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:07:51,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587831033] [2021-12-06 17:07:51,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587831033] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:07:51,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111069052] [2021-12-06 17:07:51,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:51,697 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:07:51,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:07:51,698 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:07:51,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 17:07:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:51,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 17:07:51,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:07:51,819 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 17:07:51,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:07:51,863 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 17:07:51,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111069052] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:07:51,864 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:07:51,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2021-12-06 17:07:51,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931594366] [2021-12-06 17:07:51,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:07:51,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:07:51,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:07:51,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:07:51,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:07:51,865 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:51,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:07:51,879 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2021-12-06 17:07:51,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:07:51,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-06 17:07:51,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:07:51,880 INFO L225 Difference]: With dead ends: 95 [2021-12-06 17:07:51,880 INFO L226 Difference]: Without dead ends: 95 [2021-12-06 17:07:51,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:07:51,881 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 124 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:07:51,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:07:51,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-06 17:07:51,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2021-12-06 17:07:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 88 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:51,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2021-12-06 17:07:51,883 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 36 [2021-12-06 17:07:51,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:07:51,883 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2021-12-06 17:07:51,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:51,884 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2021-12-06 17:07:51,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-06 17:07:51,884 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:07:51,884 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:07:51,904 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 17:07:52,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:07:52,085 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:07:52,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:07:52,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1215669110, now seen corresponding path program 1 times [2021-12-06 17:07:52,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:07:52,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718477334] [2021-12-06 17:07:52,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:52,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:07:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 17:07:52,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:07:52,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718477334] [2021-12-06 17:07:52,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718477334] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:07:52,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377678915] [2021-12-06 17:07:52,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:52,246 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:07:52,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:07:52,247 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:07:52,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 17:07:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:52,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 17:07:52,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:07:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 17:07:52,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:07:52,418 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 17:07:52,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377678915] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:07:52,418 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:07:52,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2021-12-06 17:07:52,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874413739] [2021-12-06 17:07:52,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:07:52,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:07:52,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:07:52,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:07:52,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:07:52,420 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:52,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:07:52,447 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2021-12-06 17:07:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:07:52,447 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-06 17:07:52,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:07:52,447 INFO L225 Difference]: With dead ends: 90 [2021-12-06 17:07:52,448 INFO L226 Difference]: Without dead ends: 90 [2021-12-06 17:07:52,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-12-06 17:07:52,448 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 142 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:07:52,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 135 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:07:52,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-06 17:07:52,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2021-12-06 17:07:52,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.36986301369863) internal successors, (100), 83 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:52,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2021-12-06 17:07:52,451 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 37 [2021-12-06 17:07:52,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:07:52,451 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2021-12-06 17:07:52,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:52,451 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2021-12-06 17:07:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-06 17:07:52,452 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:07:52,452 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:07:52,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 17:07:52,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-06 17:07:52,652 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:07:52,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:07:52,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522149, now seen corresponding path program 2 times [2021-12-06 17:07:52,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:07:52,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290349527] [2021-12-06 17:07:52,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:52,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:07:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:52,707 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 17:07:52,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:07:52,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290349527] [2021-12-06 17:07:52,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290349527] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:07:52,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:07:52,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:07:52,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414573891] [2021-12-06 17:07:52,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:07:52,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:07:52,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:07:52,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:07:52,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:07:52,709 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:52,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:07:52,732 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2021-12-06 17:07:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:07:52,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-06 17:07:52,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:07:52,733 INFO L225 Difference]: With dead ends: 89 [2021-12-06 17:07:52,733 INFO L226 Difference]: Without dead ends: 89 [2021-12-06 17:07:52,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:07:52,734 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 76 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:07:52,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 135 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:07:52,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-06 17:07:52,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2021-12-06 17:07:52,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 82 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2021-12-06 17:07:52,737 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 41 [2021-12-06 17:07:52,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:07:52,737 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2021-12-06 17:07:52,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2021-12-06 17:07:52,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-06 17:07:52,738 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:07:52,738 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:07:52,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 17:07:52,738 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:07:52,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:07:52,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522204, now seen corresponding path program 1 times [2021-12-06 17:07:52,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:07:52,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705103985] [2021-12-06 17:07:52,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:52,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:07:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:52,819 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 17:07:52,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:07:52,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705103985] [2021-12-06 17:07:52,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705103985] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:07:52,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:07:52,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:07:52,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255561216] [2021-12-06 17:07:52,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:07:52,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:07:52,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:07:52,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:07:52,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:07:52,821 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:52,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:07:52,966 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2021-12-06 17:07:52,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:07:52,966 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-06 17:07:52,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:07:52,967 INFO L225 Difference]: With dead ends: 107 [2021-12-06 17:07:52,967 INFO L226 Difference]: Without dead ends: 107 [2021-12-06 17:07:52,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:07:52,968 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 413 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:07:52,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 80 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:07:52,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-06 17:07:52,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2021-12-06 17:07:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 82 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2021-12-06 17:07:52,972 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 41 [2021-12-06 17:07:52,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:07:52,972 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2021-12-06 17:07:52,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2021-12-06 17:07:52,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-06 17:07:52,973 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:07:52,973 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:07:52,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-06 17:07:52,973 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:07:52,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:07:52,974 INFO L85 PathProgramCache]: Analyzing trace with hash -333530929, now seen corresponding path program 1 times [2021-12-06 17:07:52,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:07:52,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601884317] [2021-12-06 17:07:52,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:52,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:07:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:53,251 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 17:07:53,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:07:53,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601884317] [2021-12-06 17:07:53,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601884317] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:07:53,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571604567] [2021-12-06 17:07:53,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:53,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:07:53,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:07:53,252 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:07:53,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 17:07:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:53,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-06 17:07:53,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:07:53,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:07:53,376 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:07:53,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:07:53,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:07:53,537 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:07:53,537 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-06 17:07:53,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:07:53,606 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 33 treesize of output 26 [2021-12-06 17:07:53,653 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 31 treesize of output 13 [2021-12-06 17:07:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 17:07:53,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:07:57,150 INFO L354 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2021-12-06 17:07:57,150 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 21 treesize of output 20 [2021-12-06 17:07:57,153 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_845) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2021-12-06 17:07:57,159 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_845) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base|)) is different from false [2021-12-06 17:07:57,162 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_845) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) .cse0))) is different from false [2021-12-06 17:07:57,168 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_845) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2021-12-06 17:07:57,172 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_845) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) .cse0)))) is different from false [2021-12-06 17:07:57,176 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_845) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) .cse0)))) is different from false [2021-12-06 17:07:57,183 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_845) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))))) is different from false [2021-12-06 17:07:57,188 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:07:57,188 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 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-06 17:07:57,190 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 36 treesize of output 24 [2021-12-06 17:07:57,192 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 7 treesize of output 3 [2021-12-06 17:07:57,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 9 not checked. [2021-12-06 17:07:57,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571604567] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:07:57,260 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:07:57,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 49 [2021-12-06 17:07:57,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714026954] [2021-12-06 17:07:57,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:07:57,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-06 17:07:57,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:07:57,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-06 17:07:57,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1690, Unknown=7, NotChecked=616, Total=2450 [2021-12-06 17:07:57,262 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 50 states, 49 states have (on average 2.183673469387755) internal successors, (107), 50 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:58,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:07:58,200 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2021-12-06 17:07:58,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-06 17:07:58,201 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.183673469387755) internal successors, (107), 50 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-06 17:07:58,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:07:58,201 INFO L225 Difference]: With dead ends: 136 [2021-12-06 17:07:58,202 INFO L226 Difference]: Without dead ends: 136 [2021-12-06 17:07:58,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=587, Invalid=3724, Unknown=7, NotChecked=938, Total=5256 [2021-12-06 17:07:58,203 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 696 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 804 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:07:58,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [696 Valid, 849 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 956 Invalid, 0 Unknown, 804 Unchecked, 0.3s Time] [2021-12-06 17:07:58,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-06 17:07:58,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2021-12-06 17:07:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.35) internal successors, (108), 90 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2021-12-06 17:07:58,206 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 44 [2021-12-06 17:07:58,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:07:58,206 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2021-12-06 17:07:58,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.183673469387755) internal successors, (107), 50 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:07:58,206 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2021-12-06 17:07:58,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-06 17:07:58,206 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:07:58,207 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:07:58,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 17:07:58,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-06 17:07:58,407 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:07:58,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:07:58,408 INFO L85 PathProgramCache]: Analyzing trace with hash -333530928, now seen corresponding path program 1 times [2021-12-06 17:07:58,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:07:58,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977471621] [2021-12-06 17:07:58,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:58,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:07:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 17:07:58,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:07:58,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977471621] [2021-12-06 17:07:58,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977471621] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:07:58,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502263875] [2021-12-06 17:07:58,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:07:58,808 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:07:58,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:07:58,809 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:07:58,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 17:07:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:07:58,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 82 conjunts are in the unsatisfiable core [2021-12-06 17:07:58,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:07:58,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:07:58,971 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:07:58,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:07:59,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:07:59,039 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-12-06 17:07:59,251 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:07:59,251 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2021-12-06 17:07:59,253 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 41 treesize of output 41 [2021-12-06 17:07:59,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:07:59,341 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 40 treesize of output 33 [2021-12-06 17:07:59,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:07:59,346 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 41 treesize of output 34 [2021-12-06 17:07:59,414 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 39 treesize of output 21 [2021-12-06 17:07:59,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2021-12-06 17:07:59,464 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 17:07:59,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:08:01,689 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (and (forall ((v_ArrVal_959 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_959) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_961 Int) (v_ArrVal_959 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_959) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_961) .cse0)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|))) is different from false [2021-12-06 17:08:01,739 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:08:01,739 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 55 treesize of output 59 [2021-12-06 17:08:01,802 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (and (forall ((v_prenex_2 Int) (v_ArrVal_958 (Array Int Int))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) (forall ((v_ArrVal_961 Int) (v_ArrVal_957 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_957) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_961) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_958 (Array Int Int)) (v_ArrVal_959 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_959) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|))) is different from false [2021-12-06 17:08:01,867 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_prenex_2 Int) (v_ArrVal_958 (Array Int Int))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|)) (forall ((v_ArrVal_961 Int) (v_ArrVal_957 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_957) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_961) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base|)) (forall ((v_ArrVal_958 (Array Int Int)) (v_ArrVal_959 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_959) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))))) is different from false [2021-12-06 17:08:01,911 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (and (forall ((v_ArrVal_961 Int) (v_ArrVal_957 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_957) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_961) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (forall ((v_prenex_2 Int) (v_ArrVal_958 (Array Int Int))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1) v_ArrVal_958) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1)))) (forall ((v_ArrVal_958 (Array Int Int)) (v_ArrVal_959 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_958) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_959) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|))) is different from false [2021-12-06 17:08:01,967 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (and (forall ((v_ArrVal_958 (Array Int Int)) (v_ArrVal_959 Int)) (<= 0 (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_958) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_959) .cse0)))) (forall ((v_ArrVal_961 Int) (v_ArrVal_957 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_957) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_961) .cse2) .cse1)))) (forall ((v_prenex_2 Int) (v_ArrVal_958 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_958) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|))) is different from false [2021-12-06 17:08:01,996 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_prenex_2 Int) (v_ArrVal_958 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0) v_ArrVal_958) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0)))) (forall ((v_ArrVal_958 (Array Int Int)) (v_ArrVal_959 Int)) (<= 0 (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) v_ArrVal_958) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_959) .cse1)))) (forall ((v_ArrVal_961 Int) (v_ArrVal_957 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_957) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_961) .cse3) .cse2))))))) is different from false [2021-12-06 17:08:02,027 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (and (forall ((v_prenex_2 Int) (v_ArrVal_958 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) v_ArrVal_958) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0)))) (forall ((v_ArrVal_958 (Array Int Int)) (v_ArrVal_959 Int)) (<= 0 (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) v_ArrVal_958) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_959) .cse1)))) (forall ((v_ArrVal_961 Int) (v_ArrVal_957 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_957) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_961) .cse3) .cse2))))))) is different from false [2021-12-06 17:08:02,101 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (and (forall ((v_prenex_2 Int) (v_ArrVal_958 (Array Int Int))) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) v_ArrVal_958) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_prenex_2) .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)))) (forall ((v_ArrVal_958 (Array Int Int)) (v_ArrVal_959 Int)) (<= 0 (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) v_ArrVal_958) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_959) .cse1)))) (forall ((v_ArrVal_961 Int) (v_ArrVal_957 (Array Int Int))) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_957) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_961) .cse3) .cse2))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|))) is different from false [2021-12-06 17:08:02,115 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:08:02,115 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 1 case distinctions, treesize of input 76 treesize of output 67 [2021-12-06 17:08:02,118 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 101 treesize of output 95 [2021-12-06 17:08:02,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:08:02,122 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 89 treesize of output 77 [2021-12-06 17:08:02,129 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:08:02,130 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 1 case distinctions, treesize of input 77 treesize of output 77 [2021-12-06 17:08:02,133 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 94 treesize of output 90 [2021-12-06 17:08:02,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:08:02,136 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 87 treesize of output 79 [2021-12-06 17:08:02,141 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:08:02,142 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 51 treesize of output 47 [2021-12-06 17:08:02,144 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:08:02,145 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 44 treesize of output 40 [2021-12-06 17:08:02,147 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:08:02,148 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 37 treesize of output 33 [2021-12-06 17:08:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-06 17:08:02,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502263875] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:08:02,431 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:08:02,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 21] total 55 [2021-12-06 17:08:02,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394255495] [2021-12-06 17:08:02,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:08:02,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2021-12-06 17:08:02,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:08:02,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-12-06 17:08:02,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2116, Unknown=8, NotChecked=792, Total=3080 [2021-12-06 17:08:02,433 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 56 states, 55 states have (on average 2.109090909090909) internal successors, (116), 56 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:14,716 WARN L227 SmtUtils]: Spent 11.22s on a formula simplification. DAG size of input: 55 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 17:08:16,518 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse5)) (.cse2 (select .cse3 .cse5))) (and (<= 0 .cse0) (= 0 (select .cse1 4)) (not (= .cse2 |c_ULTIMATE.start_main_~s~0#1.base|)) (<= 8 (select |c_#length| (select .cse3 4))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (and (forall ((v_ArrVal_959 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_959) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_961 Int) (v_ArrVal_959 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_959) .cse4) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_961) .cse4)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|))) (<= (+ 4 .cse0) (select |c_#length| .cse2)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-06 17:08:16,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:08:16,972 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2021-12-06 17:08:16,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-06 17:08:16,972 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.109090909090909) internal successors, (116), 56 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-06 17:08:16,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:08:16,973 INFO L225 Difference]: With dead ends: 151 [2021-12-06 17:08:16,973 INFO L226 Difference]: Without dead ends: 151 [2021-12-06 17:08:16,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=648, Invalid=4490, Unknown=10, NotChecked=1332, Total=6480 [2021-12-06 17:08:16,975 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 551 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 2004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1011 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:08:16,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [551 Valid, 1406 Invalid, 2004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 962 Invalid, 0 Unknown, 1011 Unchecked, 0.4s Time] [2021-12-06 17:08:16,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-06 17:08:16,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 90. [2021-12-06 17:08:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 89 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2021-12-06 17:08:16,977 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 44 [2021-12-06 17:08:16,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:08:16,978 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2021-12-06 17:08:16,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.109090909090909) internal successors, (116), 56 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:16,978 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2021-12-06 17:08:16,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-06 17:08:16,978 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:08:16,978 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:08:16,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-06 17:08:17,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:08:17,180 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:08:17,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:08:17,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1958848316, now seen corresponding path program 2 times [2021-12-06 17:08:17,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:08:17,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605344878] [2021-12-06 17:08:17,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:08:17,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:08:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:08:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 17:08:17,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:08:17,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605344878] [2021-12-06 17:08:17,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605344878] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:08:17,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:08:17,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:08:17,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095585872] [2021-12-06 17:08:17,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:08:17,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:08:17,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:08:17,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:08:17,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:08:17,256 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:17,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:08:17,276 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2021-12-06 17:08:17,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:08:17,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-12-06 17:08:17,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:08:17,277 INFO L225 Difference]: With dead ends: 76 [2021-12-06 17:08:17,277 INFO L226 Difference]: Without dead ends: 76 [2021-12-06 17:08:17,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:08:17,278 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 109 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:08:17,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 73 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:08:17,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-06 17:08:17,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-12-06 17:08:17,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.173913043478261) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2021-12-06 17:08:17,281 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 47 [2021-12-06 17:08:17,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:08:17,281 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2021-12-06 17:08:17,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2021-12-06 17:08:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-06 17:08:17,282 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:08:17,282 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:08:17,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-06 17:08:17,282 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:08:17,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:08:17,283 INFO L85 PathProgramCache]: Analyzing trace with hash -645325999, now seen corresponding path program 1 times [2021-12-06 17:08:17,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:08:17,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459870655] [2021-12-06 17:08:17,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:08:17,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:08:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:08:17,766 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:08:17,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:08:17,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459870655] [2021-12-06 17:08:17,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459870655] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:08:17,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096065051] [2021-12-06 17:08:17,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:08:17,766 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:08:17,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:08:17,767 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:08:17,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 17:08:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:08:17,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 100 conjunts are in the unsatisfiable core [2021-12-06 17:08:17,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:08:17,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:08:17,874 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:08:17,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:08:17,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:08:17,922 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 6 treesize of output 5 [2021-12-06 17:08:18,118 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:08:18,119 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 65 [2021-12-06 17:08:18,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2021-12-06 17:08:18,123 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 36 treesize of output 38 [2021-12-06 17:08:18,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:08:18,213 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 45 treesize of output 38 [2021-12-06 17:08:18,217 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 30 treesize of output 32 [2021-12-06 17:08:18,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:08:18,221 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 35 treesize of output 34 [2021-12-06 17:08:18,333 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 71 treesize of output 47 [2021-12-06 17:08:18,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 31 [2021-12-06 17:08:18,417 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 35 treesize of output 23 [2021-12-06 17:08:18,546 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 17:08:18,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:08:18,716 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1130 Int) (v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1131 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1128) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1130)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1))) (forall ((v_ArrVal_1130 Int) (v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1131 Int)) (<= (+ (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1128) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1130)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|)))) is different from false [2021-12-06 17:08:18,753 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (and (forall ((v_ArrVal_1130 Int) (v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1131 Int)) (<= (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1128) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1130) .cse0)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1131) .cse0))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (forall ((v_ArrVal_1130 Int) (v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1131 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1128) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1130) .cse1)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1131) .cse1))) 1)))))) is different from false [2021-12-06 17:08:18,803 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:08:18,804 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 1 case distinctions, treesize of input 93 treesize of output 86 [2021-12-06 17:08:18,822 INFO L354 Elim1Store]: treesize reduction 90, result has 30.8 percent of original size [2021-12-06 17:08:18,823 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 190 treesize of output 169 [2021-12-06 17:08:18,829 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 125 treesize of output 111 [2021-12-06 17:08:18,833 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 111 treesize of output 97 [2021-12-06 17:08:18,915 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (let ((.cse1 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= .cse1 .cse0) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1124) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) is different from false [2021-12-06 17:08:18,984 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (let ((.cse1 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset| (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1124) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))))))) is different from false [2021-12-06 17:08:19,021 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (let ((.cse1 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (<= .cse1 .cse0) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse3) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse3) v_ArrVal_1124) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))))))) is different from false [2021-12-06 17:08:19,105 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_1124) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse3) .cse2)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (let ((.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4) v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse4)) |c_ULTIMATE.start_main_~s~0#1.base|))))))) is different from false [2021-12-06 17:08:19,149 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (and (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1123) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse1) .cse0)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) v_ArrVal_1123) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse2)) |c_ULTIMATE.start_sll_create_#res#1.base|))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) v_ArrVal_1124) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse3))))))) is different from false [2021-12-06 17:08:19,185 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) v_ArrVal_1123) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse0)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) v_ArrVal_1124) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse1)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1123) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse3) .cse2))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) is different from false [2021-12-06 17:08:19,280 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (and (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) v_ArrVal_1124) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse0)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1123) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse1)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1123) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse3)))))))) is different from false [2021-12-06 17:08:19,292 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:08:19,293 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 75 treesize of output 71 [2021-12-06 17:08:19,297 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:08:19,298 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 1 case distinctions, treesize of input 67 treesize of output 58 [2021-12-06 17:08:19,300 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 92 treesize of output 86 [2021-12-06 17:08:19,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:08:19,303 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 80 treesize of output 68 [2021-12-06 17:08:19,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:08:19,307 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 44 treesize of output 40 [2021-12-06 17:08:19,309 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:08:19,310 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 37 treesize of output 33 [2021-12-06 17:08:19,312 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:08:19,313 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 30 treesize of output 26 [2021-12-06 17:08:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-06 17:08:19,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096065051] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:08:19,450 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:08:19,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 26] total 64 [2021-12-06 17:08:19,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065591006] [2021-12-06 17:08:19,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:08:19,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-12-06 17:08:19,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:08:19,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-12-06 17:08:19,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2816, Unknown=9, NotChecked=1026, Total=4032 [2021-12-06 17:08:19,453 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 64 states, 64 states have (on average 1.890625) internal successors, (121), 64 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:21,788 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (and (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) v_ArrVal_1124) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse0)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1123) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse1)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1123) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse3)))))))) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1)) is different from false [2021-12-06 17:08:23,791 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) v_ArrVal_1123) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse0)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) v_ArrVal_1124) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse1)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1123) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse3) .cse2))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) is different from false [2021-12-06 17:08:25,795 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (and (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) v_ArrVal_1123) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse0)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) v_ArrVal_1124) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse1)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1123) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse3) .cse2))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) is different from false [2021-12-06 17:08:27,818 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (and (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1123) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse1) .cse0)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) v_ArrVal_1123) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse2)) |c_ULTIMATE.start_sll_create_#res#1.base|))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) v_ArrVal_1124) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse3))))))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) |c_ULTIMATE.start_sll_create_#res#1.base|))) is different from false [2021-12-06 17:08:29,824 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~len~0#1| .cse1) (<= .cse1 |c_ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1124) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse4) .cse3)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (let ((.cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse5) v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse5)) |c_ULTIMATE.start_main_~s~0#1.base|))))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-06 17:08:31,830 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (let ((.cse2 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (<= .cse1 .cse2) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (= .cse3 (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (<= .cse2 .cse1) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse4 (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse4) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse4) v_ArrVal_1124) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))))))) (not (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-06 17:08:33,856 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (let ((.cse2 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (<= .cse1 .cse2) (<= .cse2 .cse1) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset| (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1124) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))))))) (not (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-06 17:08:35,882 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (not (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (let ((.cse2 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (<= .cse1 .cse2) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= .cse2 .cse1) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1123) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1124) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-06 17:08:37,889 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (and (forall ((v_ArrVal_1124 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) v_ArrVal_1124) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_9) .cse0)))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (not (= (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1123) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse1)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (forall ((v_prenex_7 Int) (v_ArrVal_1123 (Array Int Int))) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1123) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_prenex_7) .cse3)))))))) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1)) is different from false [2021-12-06 17:08:37,895 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse1)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (and (forall ((v_ArrVal_1130 Int) (v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1131 Int)) (<= (+ (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1128) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1130) .cse2)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1131) .cse2))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (forall ((v_ArrVal_1130 Int) (v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1131 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1128) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1130) .cse3)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1131) .cse3))) 1)))))) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (= (select (select |c_#memory_int| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-06 17:08:37,901 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse1 (+ (select (select |c_#memory_int| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) (.cse0 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (<= .cse0 .cse1) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse2)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (and (forall ((v_ArrVal_1130 Int) (v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1131 Int)) (<= (+ (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1128) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1130) .cse3)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1131) .cse3))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (forall ((v_ArrVal_1130 Int) (v_ArrVal_1128 (Array Int Int)) (v_ArrVal_1131 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1128) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1130) .cse4)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1131) .cse4))) 1)))))) (<= .cse1 .cse0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-06 17:08:38,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:08:38,741 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2021-12-06 17:08:38,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-06 17:08:38,741 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.890625) internal successors, (121), 64 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-12-06 17:08:38,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:08:38,742 INFO L225 Difference]: With dead ends: 83 [2021-12-06 17:08:38,742 INFO L226 Difference]: Without dead ends: 83 [2021-12-06 17:08:38,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=502, Invalid=4814, Unknown=20, NotChecked=3220, Total=8556 [2021-12-06 17:08:38,745 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 195 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 629 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:08:38,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 780 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 955 Invalid, 0 Unknown, 629 Unchecked, 0.4s Time] [2021-12-06 17:08:38,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-06 17:08:38,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2021-12-06 17:08:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2021-12-06 17:08:38,746 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 48 [2021-12-06 17:08:38,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:08:38,747 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2021-12-06 17:08:38,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.890625) internal successors, (121), 64 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:38,747 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2021-12-06 17:08:38,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-06 17:08:38,747 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:08:38,747 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:08:38,779 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 17:08:38,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:08:38,949 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:08:38,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:08:38,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1693462380, now seen corresponding path program 1 times [2021-12-06 17:08:38,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:08:38,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627575115] [2021-12-06 17:08:38,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:08:38,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:08:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:08:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-06 17:08:39,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:08:39,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627575115] [2021-12-06 17:08:39,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627575115] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:08:39,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604231302] [2021-12-06 17:08:39,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:08:39,141 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:08:39,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:08:39,142 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:08:39,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 17:08:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:08:39,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-06 17:08:39,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:08:39,418 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 15 treesize of output 11 [2021-12-06 17:08:39,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:08:39,593 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 17:08:39,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:08:39,705 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 36 treesize of output 32 [2021-12-06 17:08:39,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:08:39,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:08:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-06 17:08:39,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604231302] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:08:39,794 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:08:39,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 12] total 35 [2021-12-06 17:08:39,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225261149] [2021-12-06 17:08:39,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:08:39,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-06 17:08:39,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:08:39,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-06 17:08:39,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1060, Unknown=0, NotChecked=0, Total=1190 [2021-12-06 17:08:39,795 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 35 states, 35 states have (on average 3.657142857142857) internal successors, (128), 35 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:40,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:08:40,357 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2021-12-06 17:08:40,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-06 17:08:40,357 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.657142857142857) internal successors, (128), 35 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-12-06 17:08:40,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:08:40,358 INFO L225 Difference]: With dead ends: 99 [2021-12-06 17:08:40,358 INFO L226 Difference]: Without dead ends: 99 [2021-12-06 17:08:40,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=471, Invalid=2079, Unknown=0, NotChecked=0, Total=2550 [2021-12-06 17:08:40,359 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 715 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:08:40,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [715 Valid, 514 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:08:40,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-06 17:08:40,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2021-12-06 17:08:40,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:40,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2021-12-06 17:08:40,361 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 55 [2021-12-06 17:08:40,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:08:40,361 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2021-12-06 17:08:40,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.657142857142857) internal successors, (128), 35 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2021-12-06 17:08:40,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-06 17:08:40,362 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:08:40,362 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:08:40,382 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 17:08:40,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-06 17:08:40,564 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:08:40,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:08:40,565 INFO L85 PathProgramCache]: Analyzing trace with hash 261778123, now seen corresponding path program 2 times [2021-12-06 17:08:40,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:08:40,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348174398] [2021-12-06 17:08:40,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:08:40,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:08:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:08:40,620 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 17:08:40,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:08:40,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348174398] [2021-12-06 17:08:40,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348174398] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:08:40,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049848196] [2021-12-06 17:08:40,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 17:08:40,620 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:08:40,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:08:40,621 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:08:40,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 17:08:40,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 17:08:40,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:08:40,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 17:08:40,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:08:40,788 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 17:08:40,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:08:40,853 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 17:08:40,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049848196] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:08:40,853 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:08:40,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2021-12-06 17:08:40,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589507262] [2021-12-06 17:08:40,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:08:40,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:08:40,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:08:40,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:08:40,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:08:40,854 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:40,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:08:40,880 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2021-12-06 17:08:40,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:08:40,880 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-12-06 17:08:40,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:08:40,881 INFO L225 Difference]: With dead ends: 71 [2021-12-06 17:08:40,881 INFO L226 Difference]: Without dead ends: 71 [2021-12-06 17:08:40,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-12-06 17:08:40,882 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 114 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:08:40,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 123 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:08:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-06 17:08:40,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-06 17:08:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 70 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2021-12-06 17:08:40,883 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 58 [2021-12-06 17:08:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:08:40,884 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2021-12-06 17:08:40,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:40,884 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2021-12-06 17:08:40,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 17:08:40,884 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:08:40,884 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:08:40,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-06 17:08:41,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:08:41,085 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:08:41,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:08:41,086 INFO L85 PathProgramCache]: Analyzing trace with hash 187254194, now seen corresponding path program 1 times [2021-12-06 17:08:41,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:08:41,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751952756] [2021-12-06 17:08:41,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:08:41,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:08:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:08:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-06 17:08:41,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:08:41,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751952756] [2021-12-06 17:08:41,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751952756] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:08:41,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:08:41,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:08:41,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733754442] [2021-12-06 17:08:41,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:08:41,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:08:41,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:08:41,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:08:41,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:08:41,139 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:41,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:08:41,252 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2021-12-06 17:08:41,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:08:41,252 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-12-06 17:08:41,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:08:41,253 INFO L225 Difference]: With dead ends: 82 [2021-12-06 17:08:41,253 INFO L226 Difference]: Without dead ends: 82 [2021-12-06 17:08:41,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:08:41,254 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 225 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:08:41,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 89 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:08:41,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-06 17:08:41,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2021-12-06 17:08:41,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2021-12-06 17:08:41,256 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 59 [2021-12-06 17:08:41,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:08:41,256 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2021-12-06 17:08:41,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:41,256 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2021-12-06 17:08:41,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 17:08:41,256 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:08:41,257 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:08:41,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-06 17:08:41,257 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:08:41,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:08:41,257 INFO L85 PathProgramCache]: Analyzing trace with hash 187254195, now seen corresponding path program 1 times [2021-12-06 17:08:41,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:08:41,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313172189] [2021-12-06 17:08:41,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:08:41,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:08:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:08:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 17:08:41,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:08:41,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313172189] [2021-12-06 17:08:41,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313172189] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:08:41,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:08:41,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:08:41,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337524627] [2021-12-06 17:08:41,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:08:41,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:08:41,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:08:41,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:08:41,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:08:41,345 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:41,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:08:41,493 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2021-12-06 17:08:41,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:08:41,493 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-12-06 17:08:41,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:08:41,494 INFO L225 Difference]: With dead ends: 80 [2021-12-06 17:08:41,494 INFO L226 Difference]: Without dead ends: 80 [2021-12-06 17:08:41,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:08:41,495 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 283 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:08:41,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 52 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:08:41,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-06 17:08:41,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2021-12-06 17:08:41,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 73 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:41,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2021-12-06 17:08:41,497 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 59 [2021-12-06 17:08:41,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:08:41,498 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2021-12-06 17:08:41,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:41,498 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2021-12-06 17:08:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-06 17:08:41,498 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:08:41,499 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:08:41,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-06 17:08:41,499 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:08:41,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:08:41,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1509911310, now seen corresponding path program 1 times [2021-12-06 17:08:41,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:08:41,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712137528] [2021-12-06 17:08:41,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:08:41,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:08:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:08:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 17:08:41,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:08:41,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712137528] [2021-12-06 17:08:41,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712137528] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:08:41,556 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:08:41,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 17:08:41,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779390727] [2021-12-06 17:08:41,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:08:41,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:08:41,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:08:41,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:08:41,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:08:41,557 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:41,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:08:41,654 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2021-12-06 17:08:41,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:08:41,654 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-12-06 17:08:41,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:08:41,655 INFO L225 Difference]: With dead ends: 77 [2021-12-06 17:08:41,655 INFO L226 Difference]: Without dead ends: 77 [2021-12-06 17:08:41,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:08:41,656 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 265 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:08:41,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 81 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:08:41,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-06 17:08:41,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2021-12-06 17:08:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:41,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2021-12-06 17:08:41,658 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 60 [2021-12-06 17:08:41,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:08:41,658 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2021-12-06 17:08:41,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:41,659 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2021-12-06 17:08:41,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-06 17:08:41,659 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:08:41,659 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:08:41,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-06 17:08:41,660 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:08:41,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:08:41,660 INFO L85 PathProgramCache]: Analyzing trace with hash -672727665, now seen corresponding path program 1 times [2021-12-06 17:08:41,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:08:41,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291454603] [2021-12-06 17:08:41,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:08:41,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:08:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:08:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 17:08:41,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:08:41,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291454603] [2021-12-06 17:08:41,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291454603] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:08:41,731 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:08:41,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:08:41,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577198695] [2021-12-06 17:08:41,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:08:41,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:08:41,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:08:41,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:08:41,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:08:41,733 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:41,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:08:41,833 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2021-12-06 17:08:41,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:08:41,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-06 17:08:41,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:08:41,834 INFO L225 Difference]: With dead ends: 75 [2021-12-06 17:08:41,834 INFO L226 Difference]: Without dead ends: 75 [2021-12-06 17:08:41,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:08:41,835 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:08:41,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 65 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:08:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-06 17:08:41,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-12-06 17:08:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2021-12-06 17:08:41,838 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 62 [2021-12-06 17:08:41,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:08:41,838 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2021-12-06 17:08:41,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:41,839 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2021-12-06 17:08:41,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 17:08:41,839 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:08:41,839 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:08:41,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-06 17:08:41,839 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:08:41,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:08:41,840 INFO L85 PathProgramCache]: Analyzing trace with hash -912303337, now seen corresponding path program 1 times [2021-12-06 17:08:41,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:08:41,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505874134] [2021-12-06 17:08:41,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:08:41,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:08:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:08:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 17:08:42,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:08:42,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505874134] [2021-12-06 17:08:42,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505874134] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:08:42,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883991136] [2021-12-06 17:08:42,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:08:42,171 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:08:42,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:08:42,172 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:08:42,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 17:08:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:08:42,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 81 conjunts are in the unsatisfiable core [2021-12-06 17:08:42,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:08:42,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:08:42,303 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-06 17:08:42,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-06 17:08:42,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:08:42,561 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:08:42,561 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2021-12-06 17:08:42,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:08:42,619 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 24 [2021-12-06 17:08:42,741 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:08:42,742 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 27 treesize of output 23 [2021-12-06 17:08:42,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-06 17:08:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-06 17:08:42,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:08:45,051 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (and (forall ((v_ArrVal_1661 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1661 Int)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) is different from false [2021-12-06 17:08:45,099 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (and (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1)) (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))))) is different from false [2021-12-06 17:08:45,132 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (and (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1)) (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))))) is different from false [2021-12-06 17:08:45,152 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (and (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1))))) is different from false [2021-12-06 17:08:45,189 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (and (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1)) (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) is different from false [2021-12-06 17:08:45,208 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (and (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_1660) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1)) (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_1660) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |c_ULTIMATE.start_sll_create_#res#1.base|)))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) is different from false [2021-12-06 17:08:45,226 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (and (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4)) v_ArrVal_1660) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4)) v_ArrVal_1660) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) is different from false [2021-12-06 17:08:45,275 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (and (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) v_ArrVal_1660) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1)) (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) v_ArrVal_1660) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)))))) is different from false [2021-12-06 17:08:45,282 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:08:45,283 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 1 case distinctions, treesize of input 50 treesize of output 41 [2021-12-06 17:08:45,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2021-12-06 17:08:45,290 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:08:45,290 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 90 treesize of output 92 [2021-12-06 17:08:45,295 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 89 treesize of output 87 [2021-12-06 17:08:45,304 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 98 treesize of output 96 [2021-12-06 17:08:45,570 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2021-12-06 17:08:45,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883991136] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:08:45,570 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:08:45,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 54 [2021-12-06 17:08:45,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708265826] [2021-12-06 17:08:45,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:08:45,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-06 17:08:45,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:08:45,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-06 17:08:45,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2014, Unknown=8, NotChecked=776, Total=2970 [2021-12-06 17:08:45,573 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 55 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 55 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:08:47,760 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)))) (and (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (and (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) v_ArrVal_1660) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1)) (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) v_ArrVal_1660) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)))))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1))) is different from false [2021-12-06 17:09:15,839 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select |c_#valid| .cse0) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (and (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_1660) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1)) (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_1660) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |c_ULTIMATE.start_sll_create_#res#1.base|)))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|)))) is different from false [2021-12-06 17:09:17,843 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (and (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1)) (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-06 17:09:43,926 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse1 (select .cse0 4))) (and (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse1)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (and (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1)) (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))))) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~s~0#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.offset|) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-06 17:09:45,930 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= (select |c_#valid| .cse0) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (and (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1)) (forall ((v_ArrVal_1661 Int) (v_ArrVal_1660 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1660) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-06 17:09:46,314 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (and (forall ((v_ArrVal_1661 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1661 Int)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1661) 4)) 1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-06 17:09:46,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:09:46,614 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2021-12-06 17:09:46,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-06 17:09:46,614 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 55 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-12-06 17:09:46,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:09:46,614 INFO L225 Difference]: With dead ends: 82 [2021-12-06 17:09:46,614 INFO L226 Difference]: Without dead ends: 82 [2021-12-06 17:09:46,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 63.5s TimeCoverageRelationStatistics Valid=351, Invalid=3221, Unknown=24, NotChecked=1806, Total=5402 [2021-12-06 17:09:46,616 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 132 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 650 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:09:46,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 709 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 814 Invalid, 0 Unknown, 650 Unchecked, 0.2s Time] [2021-12-06 17:09:46,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-06 17:09:46,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2021-12-06 17:09:46,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:09:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2021-12-06 17:09:46,618 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 65 [2021-12-06 17:09:46,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:09:46,618 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2021-12-06 17:09:46,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 55 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:09:46,618 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2021-12-06 17:09:46,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 17:09:46,619 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:09:46,619 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:09:46,638 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-06 17:09:46,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-06 17:09:46,820 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:09:46,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:09:46,821 INFO L85 PathProgramCache]: Analyzing trace with hash -912303336, now seen corresponding path program 1 times [2021-12-06 17:09:46,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:09:46,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52679549] [2021-12-06 17:09:46,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:09:46,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:09:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:09:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-06 17:09:47,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:09:47,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52679549] [2021-12-06 17:09:47,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52679549] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:09:47,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697109595] [2021-12-06 17:09:47,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:09:47,246 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:09:47,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:09:47,247 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:09:47,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 17:09:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:09:47,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 103 conjunts are in the unsatisfiable core [2021-12-06 17:09:47,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:09:47,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:09:47,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:09:47,455 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:09:47,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:09:47,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-06 17:09:47,539 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-12-06 17:09:47,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:09:47,783 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:09:47,784 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2021-12-06 17:09:47,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:09:47,786 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 20 treesize of output 22 [2021-12-06 17:09:47,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:09:47,849 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 24 [2021-12-06 17:09:47,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:09:47,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-06 17:09:47,995 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:09:47,995 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 17 treesize of output 17 [2021-12-06 17:09:47,999 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:09:47,999 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 27 treesize of output 23 [2021-12-06 17:09:48,109 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-06 17:09:48,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:09:50,496 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (and (forall ((v_ArrVal_1782 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1782) 4) 4))) (forall ((v_ArrVal_1781 Int) (v_ArrVal_1782 Int)) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1782) 4) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1781) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|))) is different from false [2021-12-06 17:09:50,560 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (and (forall ((v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1782 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1778) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1782) 4) 4))) (forall ((v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1781 Int) (v_ArrVal_1782 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1778) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1782) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1777) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1781) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|))) is different from false [2021-12-06 17:09:50,598 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (and (forall ((v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1781 Int) (v_ArrVal_1782 Int)) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1778) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1782) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1777) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1781) 4)))) (forall ((v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1782 Int)) (<= 0 (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1778) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1782) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|))) is different from false [2021-12-06 17:09:50,624 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (and (forall ((v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1782 Int)) (<= 0 (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1778) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1782) 4)))) (forall ((v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1781 Int) (v_ArrVal_1782 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1778) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1782) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1777) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1781) 4)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|))) is different from false [2021-12-06 17:09:50,666 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (and (forall ((v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1781 Int) (v_ArrVal_1782 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1778) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1782) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1777) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1781) 4))))) (forall ((v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1782 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1778) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1782) 4) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|))) is different from false [2021-12-06 17:09:50,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (and (forall ((v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1782 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_1778) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1782) 4) 4))) (forall ((v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1781 Int) (v_ArrVal_1782 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1778) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1782) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1777) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1781) 4)))))))) is different from false [2021-12-06 17:09:50,715 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (and (forall ((v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1781 Int) (v_ArrVal_1782 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1778) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1782) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1777) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1781) 4))))) (forall ((v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1782 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4)) v_ArrVal_1778) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1782) 4) 4)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|))) is different from false [2021-12-06 17:09:50,769 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (and (forall ((v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1781 Int) (v_ArrVal_1782 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1778) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1782) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1777) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1781) 4))))) (forall ((v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1782 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) v_ArrVal_1778) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1782) 4) 4)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|))) is different from false [2021-12-06 17:09:50,780 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:09:50,780 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 1 case distinctions, treesize of input 73 treesize of output 64 [2021-12-06 17:09:50,784 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:09:50,784 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 1 case distinctions, treesize of input 64 treesize of output 64 [2021-12-06 17:09:50,787 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 93 treesize of output 89 [2021-12-06 17:09:50,789 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 154 treesize of output 146 [2021-12-06 17:09:50,796 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:09:50,797 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 184 treesize of output 186 [2021-12-06 17:09:50,806 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:09:50,807 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 245 treesize of output 243 [2021-12-06 17:09:50,813 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 261 treesize of output 255 [2021-12-06 17:09:50,819 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 311 treesize of output 303 [2021-12-06 17:09:50,825 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 315 treesize of output 313 [2021-12-06 17:09:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2021-12-06 17:09:51,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697109595] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:09:51,344 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:09:51,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 23] total 66 [2021-12-06 17:09:51,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191777992] [2021-12-06 17:09:51,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:09:51,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2021-12-06 17:09:51,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:09:51,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2021-12-06 17:09:51,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=3218, Unknown=8, NotChecked=968, Total=4422 [2021-12-06 17:09:51,346 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 67 states, 66 states have (on average 2.5303030303030303) internal successors, (167), 67 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:11:26,173 WARN L227 SmtUtils]: Spent 1.57m on a formula simplification. DAG size of input: 106 DAG size of output: 104 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 17:11:27,220 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| 0) (= (select |c_#length| |c_ULTIMATE.start_sll_update_at_~head#1.base|) 8) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (and (forall ((v_ArrVal_1782 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1782) 4) 4))) (forall ((v_ArrVal_1781 Int) (v_ArrVal_1782 Int)) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1782) 4) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1781) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)) is different from false [2021-12-06 17:11:27,778 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse1 (select |c_#length| .cse0))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= .cse1 8) (<= 8 .cse1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (and (forall ((v_ArrVal_1782 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1782) 4) 4))) (forall ((v_ArrVal_1781 Int) (v_ArrVal_1782 Int)) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1782) 4) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1781) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-06 17:11:28,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:11:28,252 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2021-12-06 17:11:28,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-06 17:11:28,253 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 2.5303030303030303) internal successors, (167), 67 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-12-06 17:11:28,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:11:28,253 INFO L225 Difference]: With dead ends: 93 [2021-12-06 17:11:28,253 INFO L226 Difference]: Without dead ends: 93 [2021-12-06 17:11:28,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 87 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1451 ImplicationChecksByTransitivity, 99.7s TimeCoverageRelationStatistics Valid=682, Invalid=6154, Unknown=10, NotChecked=1710, Total=8556 [2021-12-06 17:11:28,255 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 184 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 1920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 801 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:11:28,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 625 Invalid, 1920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1079 Invalid, 0 Unknown, 801 Unchecked, 0.4s Time] [2021-12-06 17:11:28,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-06 17:11:28,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 80. [2021-12-06 17:11:28,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.12) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:11:28,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2021-12-06 17:11:28,257 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 65 [2021-12-06 17:11:28,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:11:28,257 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2021-12-06 17:11:28,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 2.5303030303030303) internal successors, (167), 67 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:11:28,257 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2021-12-06 17:11:28,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-06 17:11:28,258 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:11:28,258 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:11:28,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-06 17:11:28,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-06 17:11:28,460 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:11:28,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:11:28,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1783366217, now seen corresponding path program 1 times [2021-12-06 17:11:28,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:11:28,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82906042] [2021-12-06 17:11:28,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:11:28,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:11:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:11:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-06 17:11:28,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:11:28,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82906042] [2021-12-06 17:11:28,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82906042] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:11:28,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228749246] [2021-12-06 17:11:28,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:11:28,789 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:11:28,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:11:28,790 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:11:28,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-06 17:11:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:11:28,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 87 conjunts are in the unsatisfiable core [2021-12-06 17:11:28,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:11:29,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:11:29,611 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:11:29,611 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 56 [2021-12-06 17:11:29,619 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:11:29,619 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2021-12-06 17:11:29,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:11:29,837 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 72 treesize of output 59 [2021-12-06 17:11:30,366 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:11:30,367 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 70 treesize of output 58 [2021-12-06 17:11:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 17:11:30,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:11:42,096 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:11:42,096 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 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-06 17:11:42,099 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 41 treesize of output 37 [2021-12-06 17:11:42,105 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:11:42,105 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 48 treesize of output 52 [2021-12-06 17:11:42,110 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 48 treesize of output 46 [2021-12-06 17:11:42,668 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-06 17:11:42,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228749246] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:11:42,669 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:11:42,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 25] total 71 [2021-12-06 17:11:42,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224003548] [2021-12-06 17:11:42,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:11:42,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2021-12-06 17:11:42,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:11:42,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2021-12-06 17:11:42,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=4662, Unknown=32, NotChecked=0, Total=4970 [2021-12-06 17:11:42,670 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 71 states, 71 states have (on average 2.507042253521127) internal successors, (178), 71 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:11:44,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:11:44,053 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2021-12-06 17:11:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-12-06 17:11:44,054 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.507042253521127) internal successors, (178), 71 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-12-06 17:11:44,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:11:44,054 INFO L225 Difference]: With dead ends: 132 [2021-12-06 17:11:44,054 INFO L226 Difference]: Without dead ends: 132 [2021-12-06 17:11:44,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1840 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=523, Invalid=9543, Unknown=34, NotChecked=0, Total=10100 [2021-12-06 17:11:44,056 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 57 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:11:44,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 877 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 123 Unchecked, 0.0s Time] [2021-12-06 17:11:44,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-06 17:11:44,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 80. [2021-12-06 17:11:44,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:11:44,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2021-12-06 17:11:44,058 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 66 [2021-12-06 17:11:44,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:11:44,058 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2021-12-06 17:11:44,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 2.507042253521127) internal successors, (178), 71 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:11:44,058 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2021-12-06 17:11:44,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-06 17:11:44,058 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:11:44,058 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:11:44,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-06 17:11:44,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:11:44,260 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:11:44,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:11:44,261 INFO L85 PathProgramCache]: Analyzing trace with hash 124432906, now seen corresponding path program 1 times [2021-12-06 17:11:44,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:11:44,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518435474] [2021-12-06 17:11:44,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:11:44,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:11:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:11:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 17:11:44,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:11:44,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518435474] [2021-12-06 17:11:44,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518435474] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:11:44,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139270422] [2021-12-06 17:11:44,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:11:44,687 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:11:44,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:11:44,687 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:11:44,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-06 17:11:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:11:44,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 73 conjunts are in the unsatisfiable core [2021-12-06 17:11:44,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:11:44,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:11:44,835 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:11:44,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:11:44,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:11:44,977 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:11:44,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-06 17:11:45,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:11:45,019 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 24 [2021-12-06 17:11:45,110 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:11:45,110 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 27 treesize of output 23 [2021-12-06 17:11:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 17:11:45,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:11:45,797 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2008 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (<= (+ (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2008) 4) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 17:11:45,816 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2006 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2008 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2006) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2008) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2021-12-06 17:11:45,831 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2006 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2008 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2006) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2008) 4) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 17:11:45,840 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2006 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2008 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_2006) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2008) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2021-12-06 17:11:45,854 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2006 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2008 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2006) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2008) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2021-12-06 17:11:45,864 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2006 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2008 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2006) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2008) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2021-12-06 17:11:45,874 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2006 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2008 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4)) v_ArrVal_2006) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2008) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2021-12-06 17:11:45,900 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2006 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2008 Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) v_ArrVal_2006) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2008) 4) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 17:11:45,906 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:11:45,906 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 1 case distinctions, treesize of input 25 treesize of output 26 [2021-12-06 17:11:45,908 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 42 treesize of output 38 [2021-12-06 17:11:45,914 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:11:45,914 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 36 treesize of output 40 [2021-12-06 17:11:45,918 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 26 treesize of output 24 [2021-12-06 17:11:46,173 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2021-12-06 17:11:46,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139270422] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:11:46,174 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:11:46,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 47 [2021-12-06 17:11:46,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442302074] [2021-12-06 17:11:46,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:11:46,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-06 17:11:46,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:11:46,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-06 17:11:46,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1441, Unknown=8, NotChecked=664, Total=2256 [2021-12-06 17:11:46,175 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 48 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 48 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:11:47,187 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| .cse0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2008 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (<= (+ (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2008) 4) 1) |c_#StackHeapBarrier|))) (<= (+ 1 .cse0) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-06 17:11:47,566 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2008 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (<= (+ (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2008) 4) 1) |c_#StackHeapBarrier|))) (<= (+ 1 .cse0) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-06 17:11:47,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:11:47,960 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2021-12-06 17:11:47,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-06 17:11:47,961 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 48 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-12-06 17:11:47,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:11:47,961 INFO L225 Difference]: With dead ends: 81 [2021-12-06 17:11:47,961 INFO L226 Difference]: Without dead ends: 81 [2021-12-06 17:11:47,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 112 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=431, Invalid=3139, Unknown=10, NotChecked=1250, Total=4830 [2021-12-06 17:11:47,962 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 245 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 808 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:11:47,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 767 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 851 Invalid, 0 Unknown, 808 Unchecked, 0.3s Time] [2021-12-06 17:11:47,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-06 17:11:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-12-06 17:11:47,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.105263157894737) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:11:47,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2021-12-06 17:11:47,964 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 68 [2021-12-06 17:11:47,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:11:47,964 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2021-12-06 17:11:47,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 48 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:11:47,964 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2021-12-06 17:11:47,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-06 17:11:47,964 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:11:47,964 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:11:47,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-06 17:11:48,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:11:48,166 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:11:48,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:11:48,167 INFO L85 PathProgramCache]: Analyzing trace with hash 424087740, now seen corresponding path program 2 times [2021-12-06 17:11:48,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:11:48,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333413417] [2021-12-06 17:11:48,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:11:48,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:11:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:11:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 17:11:48,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:11:48,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333413417] [2021-12-06 17:11:48,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333413417] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:11:48,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588229873] [2021-12-06 17:11:48,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 17:11:48,900 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:11:48,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:11:48,900 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:11:48,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-06 17:11:49,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 17:11:49,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:11:49,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 117 conjunts are in the unsatisfiable core [2021-12-06 17:11:49,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:11:49,077 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-12-06 17:11:49,080 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-12-06 17:11:49,131 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:11:49,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:11:49,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 17:11:49,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 17:11:49,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 17:11:49,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 17:11:49,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-06 17:11:49,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-06 17:11:49,617 INFO L354 Elim1Store]: treesize reduction 84, result has 37.3 percent of original size [2021-12-06 17:11:49,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 88 [2021-12-06 17:11:49,655 INFO L354 Elim1Store]: treesize reduction 54, result has 51.8 percent of original size [2021-12-06 17:11:49,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 74 [2021-12-06 17:11:50,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:11:50,363 INFO L354 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2021-12-06 17:11:50,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 109 [2021-12-06 17:11:50,367 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 0 case distinctions, treesize of input 101 treesize of output 93 [2021-12-06 17:11:50,373 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:11:50,373 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 86 treesize of output 85 [2021-12-06 17:11:52,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:11:52,735 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-12-06 17:11:52,735 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 66 treesize of output 43 [2021-12-06 17:11:52,740 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:11:52,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-06 17:11:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-06 17:11:52,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:11:52,827 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 10 treesize of output 8 [2021-12-06 17:12:07,844 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2131 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int)) (let ((.cse2 (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2131))))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (and (forall ((v_ArrVal_2132 Int)) (= (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (select (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2132)) (select (select (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2131)) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4) 0)) (= (select (select .cse2 .cse0) 4) 0)))))) is different from false [2021-12-06 17:12:09,898 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2131 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int)) (let ((.cse1 (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2131))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (or (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (= .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|) (and (= (select (select .cse1 .cse0) 4) 0) (forall ((v_ArrVal_2132 Int)) (= (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (select (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2132)) (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2131)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) 4) 0))))))) is different from false [2021-12-06 17:12:11,955 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2131 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int)) (let ((.cse2 (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2131))))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (and (forall ((v_ArrVal_2132 Int)) (= (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (select (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2132)) (select (select (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2131)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) 4) 0)) (= (select (select .cse2 .cse0) 4) 0)))))) is different from false [2021-12-06 17:12:14,086 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2131 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int)) (let ((.cse1 (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2131))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (and (forall ((v_ArrVal_2132 Int)) (= (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (select (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2132)) (select (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2131)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0)) (= (select (select .cse1 .cse2) 4) 0)) (= .cse2 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))))) is different from false [2021-12-06 17:12:16,278 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2131 Int) (v_ArrVal_2125 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int)) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse1 (let ((.cse10 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse10)) (.cse9 (select .cse10 4))) (store .cse8 .cse9 (store (select .cse8 .cse9) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2131)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0 v_ArrVal_2125) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (and (= (select (select .cse1 .cse2) 4) 0) (forall ((v_ArrVal_2132 Int)) (= (select (let ((.cse5 (+ 4 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse7 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse4 (select .cse7 4))) (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse5 v_ArrVal_2125)))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2132))) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse7))) (store .cse6 .cse4 (store (select .cse6 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2131))) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))))) 4) 0))) (= .cse2 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2125)))))) is different from false [2021-12-06 17:12:18,486 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2131 Int) (v_ArrVal_2125 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int)) (let ((.cse0 (+ 4 |c_ULTIMATE.start_node_create_#res#1.offset|))) (let ((.cse1 (let ((.cse10 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse10)) (.cse9 (select .cse10 4))) (store .cse8 .cse9 (store (select .cse8 .cse9) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2131)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_node_create_#res#1.base|) 4))) (or (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse0 v_ArrVal_2125) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (and (= (select (select .cse1 .cse2) 4) 0) (forall ((v_ArrVal_2132 Int)) (= (select (let ((.cse5 (+ 4 |c_ULTIMATE.start_node_create_#res#1.offset|))) (let ((.cse7 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse4 (select .cse7 4))) (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse5 v_ArrVal_2125)))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2132))) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse7))) (store .cse6 .cse4 (store (select .cse6 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2131))) |c_ULTIMATE.start_node_create_#res#1.base|) 4))))) 4) 0))) (= .cse2 |c_ULTIMATE.start_node_create_#res#1.base|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2125)))))) is different from false [2021-12-06 17:12:20,686 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2131 Int) (v_ArrVal_2125 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_node_create_~temp~0#1.offset| 4))) (let ((.cse2 (let ((.cse10 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse10)) (.cse9 (select .cse10 4))) (store .cse8 .cse9 (store (select .cse8 .cse9) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2131)))))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse0) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2125) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse1 v_ArrVal_2125) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (and (= (select (select .cse2 .cse0) 4) 0) (forall ((v_ArrVal_2132 Int)) (= (select (let ((.cse5 (+ |c_ULTIMATE.start_node_create_~temp~0#1.offset| 4))) (let ((.cse7 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse4 (select .cse7 4))) (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse5 v_ArrVal_2125)))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2132))) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse7))) (store .cse6 .cse4 (store (select .cse6 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2131))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))))) 4) 0)))))))) is different from false [2021-12-06 17:12:20,726 INFO L354 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2021-12-06 17:12:20,727 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 197 treesize of output 204 [2021-12-06 17:12:20,757 INFO L354 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2021-12-06 17:12:20,758 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 379 treesize of output 298 [2021-12-06 17:12:20,844 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:12:20,844 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 32 treesize of output 32 [2021-12-06 17:12:23,159 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:12:23,159 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 13 treesize of output 17 [2021-12-06 17:12:23,836 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:12:23,836 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 13 treesize of output 17 [2021-12-06 17:12:24,127 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:12:24,127 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 13 treesize of output 17 [2021-12-06 17:12:24,363 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2131 Int) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_node_create_~temp~0#1.offset| 4)) (.cse10 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (< (select v_arrayElimArr_11 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (and (let ((.cse5 (let ((.cse7 (select v_arrayElimArr_12 4))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2131))))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= .cse1 |c_ULTIMATE.start_node_create_~temp~0#1.base|) (and (forall ((v_ArrVal_2132 Int)) (= (select (let ((.cse3 (select v_arrayElimArr_12 4))) (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2132))) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2131))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)) (= (select (select .cse5 .cse1) 4) 0))))) (or (forall ((v_ArrVal_2132 Int)) (= (select (select (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse8 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2132))) (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2131))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)) (not .cse10))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_arrayElimArr_11 .cse0)) (and .cse10 (= (select (select (store .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2131)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4) |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) is different from false [2021-12-06 17:12:24,410 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:12:24,410 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 13 treesize of output 17 [2021-12-06 17:12:25,111 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:12:25,111 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 13 treesize of output 17 [2021-12-06 17:12:25,426 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:12:25,426 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 13 treesize of output 17 [2021-12-06 17:12:25,736 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:12:25,736 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 13 treesize of output 17 [2021-12-06 17:12:26,445 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:12:26,446 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 13 treesize of output 17 [2021-12-06 17:12:26,758 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:12:26,758 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 13 treesize of output 17 [2021-12-06 17:12:27,070 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 11 treesize of output 7 [2021-12-06 17:12:27,375 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 11 treesize of output 7 [2021-12-06 17:12:27,807 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 11 treesize of output 7 [2021-12-06 17:12:28,065 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 11 treesize of output 7 [2021-12-06 17:12:28,331 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 11 treesize of output 7 [2021-12-06 17:12:28,587 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 11 treesize of output 7 [2021-12-06 17:12:28,773 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:12:28,774 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 1 case distinctions, treesize of input 175 treesize of output 166 [2021-12-06 17:12:28,781 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:12:28,781 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 1 case distinctions, treesize of input 211 treesize of output 141 [2021-12-06 17:12:28,784 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:12:28,791 INFO L354 Elim1Store]: treesize reduction 26, result has 13.3 percent of original size [2021-12-06 17:12:28,791 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 322 treesize of output 292 [2021-12-06 17:12:28,799 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:12:28,801 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2021-12-06 17:12:28,806 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-06 17:12:28,806 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:12:28,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2021-12-06 17:12:28,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319456867] [2021-12-06 17:12:28,806 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 17:12:28,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-06 17:12:28,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:12:28,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-06 17:12:28,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=3914, Unknown=15, NotChecked=1064, Total=5256 [2021-12-06 17:12:28,807 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 32 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:28,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 17:12:28,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=263, Invalid=3914, Unknown=15, NotChecked=1064, Total=5256 [2021-12-06 17:12:28,808 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:12:28,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:12:28,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-12-06 17:12:29,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-12-06 17:12:29,011 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@25260191 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-06 17:12:29,019 INFO L158 Benchmark]: Toolchain (without parser) took 285333.26ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 77.2MB in the beginning and 104.1MB in the end (delta: -26.9MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:12:29,019 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:12:29,020 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.66ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 85.3MB in the end (delta: -8.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 17:12:29,020 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.43ms. Allocated memory is still 117.4MB. Free memory was 85.3MB in the beginning and 83.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:12:29,021 INFO L158 Benchmark]: Boogie Preprocessor took 24.13ms. Allocated memory is still 117.4MB. Free memory was 83.2MB in the beginning and 81.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:12:29,021 INFO L158 Benchmark]: RCFGBuilder took 309.47ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 66.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-06 17:12:29,022 INFO L158 Benchmark]: TraceAbstraction took 284666.91ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 65.9MB in the beginning and 104.1MB in the end (delta: -38.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:12:29,026 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.66ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 85.3MB in the end (delta: -8.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.43ms. Allocated memory is still 117.4MB. Free memory was 85.3MB in the beginning and 83.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.13ms. Allocated memory is still 117.4MB. Free memory was 83.2MB in the beginning and 81.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 309.47ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 66.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 284666.91ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 65.9MB in the beginning and 104.1MB in the end (delta: -38.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@25260191 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@25260191: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-06 17:12:29,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:12:30,533 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:12:30,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:12:30,557 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:12:30,557 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:12:30,558 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:12:30,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:12:30,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:12:30,563 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:12:30,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:12:30,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:12:30,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:12:30,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:12:30,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:12:30,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:12:30,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:12:30,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:12:30,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:12:30,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:12:30,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:12:30,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:12:30,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:12:30,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:12:30,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:12:30,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:12:30,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:12:30,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:12:30,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:12:30,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:12:30,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:12:30,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:12:30,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:12:30,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:12:30,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:12:30,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:12:30,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:12:30,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:12:30,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:12:30,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:12:30,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:12:30,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:12:30,597 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-06 17:12:30,616 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:12:30,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:12:30,617 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:12:30,617 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:12:30,617 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:12:30,618 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:12:30,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:12:30,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:12:30,618 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:12:30,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:12:30,619 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:12:30,619 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 17:12:30,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 17:12:30,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:12:30,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:12:30,619 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-06 17:12:30,620 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-06 17:12:30,620 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-06 17:12:30,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:12:30,620 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 17:12:30,620 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-06 17:12:30,620 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-06 17:12:30,620 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:12:30,621 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:12:30,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:12:30,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:12:30,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:12:30,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:12:30,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:12:30,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:12:30,622 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-06 17:12:30,622 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-06 17:12:30,622 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:12:30,622 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-06 17:12:30,622 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2021-12-06 17:12:30,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:12:30,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:12:30,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:12:30,884 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:12:30,884 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:12:30,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2021-12-06 17:12:30,926 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/data/66a8b703b/65f1518b8afb47e18d2bf4eaad59739b/FLAG027103973 [2021-12-06 17:12:31,349 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:12:31,349 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2021-12-06 17:12:31,359 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/data/66a8b703b/65f1518b8afb47e18d2bf4eaad59739b/FLAG027103973 [2021-12-06 17:12:31,368 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/data/66a8b703b/65f1518b8afb47e18d2bf4eaad59739b [2021-12-06 17:12:31,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:12:31,371 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:12:31,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:12:31,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:12:31,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:12:31,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:12:31" (1/1) ... [2021-12-06 17:12:31,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@da9b781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:12:31, skipping insertion in model container [2021-12-06 17:12:31,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:12:31" (1/1) ... [2021-12-06 17:12:31,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:12:31,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:12:31,611 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_e7ff5680-3a39-45ce-909f-6401cbc1f059/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2021-12-06 17:12:31,613 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:12:31,622 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:12:31,653 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_e7ff5680-3a39-45ce-909f-6401cbc1f059/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2021-12-06 17:12:31,654 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:12:31,679 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:12:31,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:12:31 WrapperNode [2021-12-06 17:12:31,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:12:31,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:12:31,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:12:31,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:12:31,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:12:31" (1/1) ... [2021-12-06 17:12:31,699 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:12:31" (1/1) ... [2021-12-06 17:12:31,717 INFO L137 Inliner]: procedures = 129, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2021-12-06 17:12:31,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:12:31,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:12:31,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:12:31,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:12:31,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:12:31" (1/1) ... [2021-12-06 17:12:31,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:12:31" (1/1) ... [2021-12-06 17:12:31,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:12:31" (1/1) ... [2021-12-06 17:12:31,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:12:31" (1/1) ... [2021-12-06 17:12:31,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:12:31" (1/1) ... [2021-12-06 17:12:31,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:12:31" (1/1) ... [2021-12-06 17:12:31,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:12:31" (1/1) ... [2021-12-06 17:12:31,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:12:31,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:12:31,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:12:31,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:12:31,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:12:31" (1/1) ... [2021-12-06 17:12:31,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:12:31,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:12:31,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 17:12:31,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 17:12:31,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-06 17:12:31,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 17:12:31,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:12:31,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 17:12:31,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 17:12:31,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 17:12:31,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-06 17:12:31,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-06 17:12:31,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:12:31,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:12:31,881 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:12:31,882 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:12:32,121 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:12:32,126 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:12:32,127 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-06 17:12:32,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:12:32 BoogieIcfgContainer [2021-12-06 17:12:32,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:12:32,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 17:12:32,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 17:12:32,131 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 17:12:32,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:12:31" (1/3) ... [2021-12-06 17:12:32,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b82a405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:12:32, skipping insertion in model container [2021-12-06 17:12:32,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:12:31" (2/3) ... [2021-12-06 17:12:32,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b82a405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:12:32, skipping insertion in model container [2021-12-06 17:12:32,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:12:32" (3/3) ... [2021-12-06 17:12:32,133 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2021-12-06 17:12:32,137 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 17:12:32,137 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2021-12-06 17:12:32,170 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 17:12:32,175 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 17:12:32,175 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2021-12-06 17:12:32,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:32,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-06 17:12:32,190 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:12:32,191 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-06 17:12:32,191 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:12:32,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:12:32,195 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2021-12-06 17:12:32,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:12:32,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254949764] [2021-12-06 17:12:32,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:12:32,204 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:12:32,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:12:32,205 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:12:32,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-06 17:12:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:12:32,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:12:32,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:12:32,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:12:32,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:12:32,352 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:12:32,353 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:12:32,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254949764] [2021-12-06 17:12:32,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254949764] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:12:32,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:12:32,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:12:32,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096041270] [2021-12-06 17:12:32,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:12:32,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:12:32,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:12:32,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:12:32,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:12:32,384 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:32,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:12:32,526 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2021-12-06 17:12:32,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:12:32,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-06 17:12:32,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:12:32,535 INFO L225 Difference]: With dead ends: 109 [2021-12-06 17:12:32,535 INFO L226 Difference]: Without dead ends: 104 [2021-12-06 17:12:32,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:12:32,540 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 63 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:12:32,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 133 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:12:32,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-06 17:12:32,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2021-12-06 17:12:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.6) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:32,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2021-12-06 17:12:32,570 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 5 [2021-12-06 17:12:32,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:12:32,570 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2021-12-06 17:12:32,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2021-12-06 17:12:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-06 17:12:32,571 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:12:32,571 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-06 17:12:32,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-06 17:12:32,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:12:32,773 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:12:32,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:12:32,776 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2021-12-06 17:12:32,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:12:32,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713378972] [2021-12-06 17:12:32,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:12:32,781 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:12:32,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:12:32,785 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:12:32,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-06 17:12:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:12:32,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 17:12:32,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:12:32,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:12:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:12:32,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:12:32,963 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:12:32,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713378972] [2021-12-06 17:12:32,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713378972] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:12:32,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:12:32,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:12:32,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791904103] [2021-12-06 17:12:32,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:12:32,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:12:32,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:12:32,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:12:32,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:12:32,965 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:33,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:12:33,081 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2021-12-06 17:12:33,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:12:33,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-06 17:12:33,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:12:33,083 INFO L225 Difference]: With dead ends: 102 [2021-12-06 17:12:33,083 INFO L226 Difference]: Without dead ends: 102 [2021-12-06 17:12:33,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:12:33,084 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 58 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:12:33,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:12:33,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-06 17:12:33,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 57. [2021-12-06 17:12:33,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.55) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:33,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2021-12-06 17:12:33,090 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 5 [2021-12-06 17:12:33,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:12:33,090 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2021-12-06 17:12:33,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:33,090 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2021-12-06 17:12:33,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-06 17:12:33,091 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:12:33,091 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:12:33,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-06 17:12:33,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:12:33,293 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:12:33,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:12:33,295 INFO L85 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2021-12-06 17:12:33,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:12:33,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242813212] [2021-12-06 17:12:33,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:12:33,298 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:12:33,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:12:33,300 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:12:33,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-06 17:12:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:12:33,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 17:12:33,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:12:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:12:33,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:12:33,472 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:12:33,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242813212] [2021-12-06 17:12:33,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242813212] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:12:33,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:12:33,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:12:33,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47643877] [2021-12-06 17:12:33,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:12:33,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:12:33,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:12:33,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:12:33,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:12:33,475 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:12:33,487 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2021-12-06 17:12:33,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:12:33,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-06 17:12:33,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:12:33,489 INFO L225 Difference]: With dead ends: 68 [2021-12-06 17:12:33,489 INFO L226 Difference]: Without dead ends: 68 [2021-12-06 17:12:33,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:12:33,491 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:12:33,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:12:33,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-06 17:12:33,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2021-12-06 17:12:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:33,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2021-12-06 17:12:33,498 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 8 [2021-12-06 17:12:33,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:12:33,498 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2021-12-06 17:12:33,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:33,499 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2021-12-06 17:12:33,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-06 17:12:33,499 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:12:33,499 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:12:33,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-06 17:12:33,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:12:33,701 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:12:33,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:12:33,702 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2021-12-06 17:12:33,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:12:33,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671990893] [2021-12-06 17:12:33,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:12:33,703 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:12:33,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:12:33,704 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:12:33,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-06 17:12:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:12:33,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 17:12:33,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:12:33,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:12:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:12:33,828 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:12:33,828 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:12:33,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671990893] [2021-12-06 17:12:33,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671990893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:12:33,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:12:33,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:12:33,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556476065] [2021-12-06 17:12:33,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:12:33,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:12:33,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:12:33,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:12:33,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:12:33,830 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:33,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:12:33,995 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2021-12-06 17:12:33,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:12:33,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-06 17:12:33,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:12:33,996 INFO L225 Difference]: With dead ends: 76 [2021-12-06 17:12:33,996 INFO L226 Difference]: Without dead ends: 76 [2021-12-06 17:12:33,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:12:33,997 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 163 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:12:33,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 67 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:12:33,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-06 17:12:34,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2021-12-06 17:12:34,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:34,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2021-12-06 17:12:34,002 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 9 [2021-12-06 17:12:34,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:12:34,003 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2021-12-06 17:12:34,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:34,003 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2021-12-06 17:12:34,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-06 17:12:34,003 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:12:34,003 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:12:34,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-06 17:12:34,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:12:34,205 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:12:34,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:12:34,207 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2021-12-06 17:12:34,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:12:34,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225997654] [2021-12-06 17:12:34,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:12:34,210 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:12:34,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:12:34,214 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:12:34,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-06 17:12:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:12:34,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-06 17:12:34,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:12:34,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:12:34,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:12:34,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:12:34,372 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:12:34,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225997654] [2021-12-06 17:12:34,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [225997654] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:12:34,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:12:34,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:12:34,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473686014] [2021-12-06 17:12:34,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:12:34,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:12:34,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:12:34,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:12:34,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:12:34,374 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:34,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:12:34,514 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2021-12-06 17:12:34,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:12:34,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-06 17:12:34,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:12:34,516 INFO L225 Difference]: With dead ends: 61 [2021-12-06 17:12:34,516 INFO L226 Difference]: Without dead ends: 61 [2021-12-06 17:12:34,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:12:34,517 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 163 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:12:34,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 45 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:12:34,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-06 17:12:34,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2021-12-06 17:12:34,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2021-12-06 17:12:34,522 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2021-12-06 17:12:34,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:12:34,522 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2021-12-06 17:12:34,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:34,523 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2021-12-06 17:12:34,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-06 17:12:34,523 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:12:34,523 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:12:34,530 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-06 17:12:34,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:12:34,725 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:12:34,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:12:34,726 INFO L85 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2021-12-06 17:12:34,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:12:34,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859823174] [2021-12-06 17:12:34,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:12:34,728 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:12:34,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:12:34,731 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:12:34,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-06 17:12:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:12:34,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 17:12:34,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:12:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:12:34,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:12:34,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:12:34,922 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:12:34,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859823174] [2021-12-06 17:12:34,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1859823174] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:12:34,922 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:12:34,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-06 17:12:34,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740226351] [2021-12-06 17:12:34,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:12:34,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:12:34,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:12:34,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:12:34,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:12:34,924 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:34,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:12:34,940 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2021-12-06 17:12:34,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:12:34,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-06 17:12:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:12:34,941 INFO L225 Difference]: With dead ends: 73 [2021-12-06 17:12:34,941 INFO L226 Difference]: Without dead ends: 73 [2021-12-06 17:12:34,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:12:34,942 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 23 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:12:34,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 226 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:12:34,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-06 17:12:34,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2021-12-06 17:12:34,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.4) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2021-12-06 17:12:34,946 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 17 [2021-12-06 17:12:34,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:12:34,946 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2021-12-06 17:12:34,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:34,946 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2021-12-06 17:12:34,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 17:12:34,947 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:12:34,947 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:12:34,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-06 17:12:35,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:12:35,149 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:12:35,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:12:35,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 2 times [2021-12-06 17:12:35,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:12:35,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990635727] [2021-12-06 17:12:35,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 17:12:35,152 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:12:35,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:12:35,155 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:12:35,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-06 17:12:35,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-06 17:12:35,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:12:35,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 17:12:35,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:12:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-06 17:12:35,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:12:35,277 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:12:35,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990635727] [2021-12-06 17:12:35,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990635727] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:12:35,278 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:12:35,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:12:35,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519668330] [2021-12-06 17:12:35,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:12:35,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:12:35,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:12:35,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:12:35,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:12:35,279 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:35,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:12:35,313 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2021-12-06 17:12:35,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:12:35,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-06 17:12:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:12:35,315 INFO L225 Difference]: With dead ends: 96 [2021-12-06 17:12:35,315 INFO L226 Difference]: Without dead ends: 96 [2021-12-06 17:12:35,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:12:35,315 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 111 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:12:35,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 155 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:12:35,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-06 17:12:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 68. [2021-12-06 17:12:35,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:35,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2021-12-06 17:12:35,319 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 26 [2021-12-06 17:12:35,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:12:35,319 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2021-12-06 17:12:35,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:35,319 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2021-12-06 17:12:35,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 17:12:35,320 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:12:35,320 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:12:35,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-06 17:12:35,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:12:35,522 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:12:35,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:12:35,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913225, now seen corresponding path program 1 times [2021-12-06 17:12:35,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:12:35,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576743850] [2021-12-06 17:12:35,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:12:35,525 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:12:35,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:12:35,528 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:12:35,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-06 17:12:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:12:35,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 17:12:35,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:12:35,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:12:35,742 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 17:12:35,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:12:35,743 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:12:35,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576743850] [2021-12-06 17:12:35,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576743850] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:12:35,743 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:12:35,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:12:35,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414646141] [2021-12-06 17:12:35,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:12:35,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:12:35,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:12:35,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:12:35,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:12:35,744 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:36,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:12:36,147 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2021-12-06 17:12:36,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:12:36,148 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-06 17:12:36,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:12:36,148 INFO L225 Difference]: With dead ends: 87 [2021-12-06 17:12:36,148 INFO L226 Difference]: Without dead ends: 87 [2021-12-06 17:12:36,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:12:36,149 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 359 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:12:36,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 106 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:12:36,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-06 17:12:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 71. [2021-12-06 17:12:36,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 70 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:36,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2021-12-06 17:12:36,154 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 26 [2021-12-06 17:12:36,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:12:36,155 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2021-12-06 17:12:36,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:36,155 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2021-12-06 17:12:36,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 17:12:36,156 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:12:36,156 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:12:36,163 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-06 17:12:36,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:12:36,358 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:12:36,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:12:36,359 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913226, now seen corresponding path program 1 times [2021-12-06 17:12:36,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:12:36,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132367746] [2021-12-06 17:12:36,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:12:36,361 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:12:36,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:12:36,363 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:12:36,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-06 17:12:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:12:36,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-06 17:12:36,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:12:36,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:12:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 17:12:36,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:12:36,590 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:12:36,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132367746] [2021-12-06 17:12:36,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132367746] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:12:36,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:12:36,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:12:36,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318242659] [2021-12-06 17:12:36,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:12:36,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:12:36,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:12:36,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:12:36,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:12:36,591 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:37,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:12:37,045 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2021-12-06 17:12:37,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:12:37,045 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-06 17:12:37,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:12:37,046 INFO L225 Difference]: With dead ends: 107 [2021-12-06 17:12:37,046 INFO L226 Difference]: Without dead ends: 107 [2021-12-06 17:12:37,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:12:37,047 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 365 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:12:37,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 106 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:12:37,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-06 17:12:37,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 71. [2021-12-06 17:12:37,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.375) internal successors, (77), 70 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:37,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2021-12-06 17:12:37,052 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 26 [2021-12-06 17:12:37,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:12:37,052 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2021-12-06 17:12:37,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:37,053 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2021-12-06 17:12:37,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-06 17:12:37,053 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:12:37,053 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:12:37,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-06 17:12:37,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:12:37,255 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:12:37,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:12:37,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2021-12-06 17:12:37,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:12:37,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058380440] [2021-12-06 17:12:37,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:12:37,258 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:12:37,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:12:37,261 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:12:37,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-06 17:12:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:12:37,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-06 17:12:37,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:12:37,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:12:37,463 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 17:12:37,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 32 [2021-12-06 17:12:37,590 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-12-06 17:12:37,805 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 28 treesize of output 20 [2021-12-06 17:12:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:12:37,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:12:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:12:38,218 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:12:38,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058380440] [2021-12-06 17:12:38,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058380440] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:12:38,218 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:12:38,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 22 [2021-12-06 17:12:38,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163867042] [2021-12-06 17:12:38,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:12:38,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-06 17:12:38,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:12:38,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-06 17:12:38,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2021-12-06 17:12:38,219 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:38,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:12:38,928 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2021-12-06 17:12:38,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 17:12:38,928 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-06 17:12:38,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:12:38,929 INFO L225 Difference]: With dead ends: 92 [2021-12-06 17:12:38,929 INFO L226 Difference]: Without dead ends: 92 [2021-12-06 17:12:38,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2021-12-06 17:12:38,930 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 64 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 258 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:12:38,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 592 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 250 Invalid, 0 Unknown, 258 Unchecked, 0.4s Time] [2021-12-06 17:12:38,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-06 17:12:38,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 76. [2021-12-06 17:12:38,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2021-12-06 17:12:38,933 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 29 [2021-12-06 17:12:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:12:38,934 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2021-12-06 17:12:38,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2021-12-06 17:12:38,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-06 17:12:38,935 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:12:38,935 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:12:38,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-06 17:12:39,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:12:39,135 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:12:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:12:39,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687585, now seen corresponding path program 1 times [2021-12-06 17:12:39,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:12:39,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509446932] [2021-12-06 17:12:39,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:12:39,136 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:12:39,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:12:39,137 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:12:39,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-06 17:12:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:12:39,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-06 17:12:39,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:12:39,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:12:39,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:12:39,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:12:39,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-06 17:12:39,385 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:12:39,386 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 16 treesize of output 16 [2021-12-06 17:12:39,451 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-12-06 17:12:39,457 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-12-06 17:12:39,623 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 17 treesize of output 9 [2021-12-06 17:12:39,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:12:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:12:39,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:12:43,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:12:43,878 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:12:43,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509446932] [2021-12-06 17:12:43,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509446932] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:12:43,878 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:12:43,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2021-12-06 17:12:43,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499481183] [2021-12-06 17:12:43,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:12:43,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-06 17:12:43,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:12:43,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-06 17:12:43,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=687, Unknown=1, NotChecked=0, Total=756 [2021-12-06 17:12:43,879 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:48,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:12:48,768 INFO L93 Difference]: Finished difference Result 208 states and 224 transitions. [2021-12-06 17:12:48,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-06 17:12:48,769 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-06 17:12:48,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:12:48,770 INFO L225 Difference]: With dead ends: 208 [2021-12-06 17:12:48,770 INFO L226 Difference]: Without dead ends: 208 [2021-12-06 17:12:48,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=534, Invalid=1915, Unknown=1, NotChecked=0, Total=2450 [2021-12-06 17:12:48,772 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 1521 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:12:48,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1521 Valid, 537 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 572 Invalid, 0 Unknown, 189 Unchecked, 2.2s Time] [2021-12-06 17:12:48,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-12-06 17:12:48,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 84. [2021-12-06 17:12:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.391304347826087) internal successors, (96), 83 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:48,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2021-12-06 17:12:48,777 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 29 [2021-12-06 17:12:48,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:12:48,777 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2021-12-06 17:12:48,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:48,778 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2021-12-06 17:12:48,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-06 17:12:48,779 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:12:48,779 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:12:48,787 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-12-06 17:12:48,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:12:48,980 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:12:48,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:12:48,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1082686446, now seen corresponding path program 2 times [2021-12-06 17:12:48,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:12:48,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279393506] [2021-12-06 17:12:48,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 17:12:48,984 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:12:48,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:12:48,987 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:12:48,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-06 17:12:49,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 17:12:49,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:12:49,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 17:12:49,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:12:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-06 17:12:49,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:12:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-06 17:12:49,273 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:12:49,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279393506] [2021-12-06 17:12:49,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279393506] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:12:49,273 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:12:49,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-06 17:12:49,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232262413] [2021-12-06 17:12:49,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:12:49,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 17:12:49,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:12:49,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 17:12:49,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:12:49,274 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:49,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:12:49,543 INFO L93 Difference]: Finished difference Result 298 states and 326 transitions. [2021-12-06 17:12:49,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 17:12:49,543 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-06 17:12:49,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:12:49,545 INFO L225 Difference]: With dead ends: 298 [2021-12-06 17:12:49,545 INFO L226 Difference]: Without dead ends: 298 [2021-12-06 17:12:49,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2021-12-06 17:12:49,546 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 752 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:12:49,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [752 Valid, 318 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:12:49,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-12-06 17:12:49,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 92. [2021-12-06 17:12:49,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 91 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:49,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2021-12-06 17:12:49,552 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 32 [2021-12-06 17:12:49,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:12:49,552 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2021-12-06 17:12:49,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2021-12-06 17:12:49,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 17:12:49,553 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:12:49,553 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:12:49,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-12-06 17:12:49,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:12:49,755 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:12:49,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:12:49,756 INFO L85 PathProgramCache]: Analyzing trace with hash -516260032, now seen corresponding path program 1 times [2021-12-06 17:12:49,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:12:49,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756084493] [2021-12-06 17:12:49,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:12:49,759 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:12:49,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:12:49,762 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:12:49,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-06 17:12:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:12:49,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 17:12:49,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:12:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 17:12:49,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:12:50,036 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 17:12:50,036 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:12:50,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756084493] [2021-12-06 17:12:50,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756084493] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:12:50,036 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:12:50,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-06 17:12:50,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924111779] [2021-12-06 17:12:50,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:12:50,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:12:50,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:12:50,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:12:50,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:12:50,037 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:50,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:12:50,087 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2021-12-06 17:12:50,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:12:50,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-06 17:12:50,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:12:50,088 INFO L225 Difference]: With dead ends: 126 [2021-12-06 17:12:50,088 INFO L226 Difference]: Without dead ends: 126 [2021-12-06 17:12:50,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-12-06 17:12:50,089 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 159 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:12:50,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 256 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:12:50,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-06 17:12:50,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 101. [2021-12-06 17:12:50,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 100 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2021-12-06 17:12:50,092 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 36 [2021-12-06 17:12:50,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:12:50,092 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2021-12-06 17:12:50,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:50,092 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2021-12-06 17:12:50,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-06 17:12:50,093 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:12:50,093 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:12:50,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-12-06 17:12:50,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:12:50,294 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:12:50,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:12:50,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1215669110, now seen corresponding path program 1 times [2021-12-06 17:12:50,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:12:50,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033284690] [2021-12-06 17:12:50,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:12:50,297 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:12:50,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:12:50,299 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:12:50,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-06 17:12:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:12:50,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 17:12:50,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:12:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 17:12:50,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:12:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 17:12:50,642 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:12:50,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033284690] [2021-12-06 17:12:50,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033284690] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:12:50,642 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:12:50,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-06 17:12:50,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182937526] [2021-12-06 17:12:50,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:12:50,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 17:12:50,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:12:50,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 17:12:50,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:12:50,643 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:50,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:12:50,739 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2021-12-06 17:12:50,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 17:12:50,740 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-06 17:12:50,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:12:50,740 INFO L225 Difference]: With dead ends: 85 [2021-12-06 17:12:50,741 INFO L226 Difference]: Without dead ends: 85 [2021-12-06 17:12:50,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:12:50,741 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 265 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:12:50,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 184 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:12:50,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-06 17:12:50,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2021-12-06 17:12:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 77 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:50,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2021-12-06 17:12:50,744 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 37 [2021-12-06 17:12:50,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:12:50,744 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2021-12-06 17:12:50,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:50,744 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2021-12-06 17:12:50,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-06 17:12:50,744 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:12:50,744 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:12:50,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-12-06 17:12:50,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:12:50,946 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:12:50,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:12:50,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522148, now seen corresponding path program 2 times [2021-12-06 17:12:50,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:12:50,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530465084] [2021-12-06 17:12:50,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 17:12:50,949 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:12:50,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:12:50,951 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:12:50,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-06 17:12:51,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-06 17:12:51,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:12:51,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 17:12:51,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:12:51,070 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 17:12:51,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:12:51,071 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:12:51,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530465084] [2021-12-06 17:12:51,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530465084] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:12:51,071 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:12:51,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:12:51,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253085614] [2021-12-06 17:12:51,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:12:51,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:12:51,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:12:51,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:12:51,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:12:51,072 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:51,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:12:51,111 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2021-12-06 17:12:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:12:51,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-06 17:12:51,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:12:51,112 INFO L225 Difference]: With dead ends: 89 [2021-12-06 17:12:51,112 INFO L226 Difference]: Without dead ends: 89 [2021-12-06 17:12:51,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:12:51,112 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 82 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:12:51,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 140 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:12:51,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-06 17:12:51,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2021-12-06 17:12:51,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 78 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2021-12-06 17:12:51,114 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 41 [2021-12-06 17:12:51,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:12:51,115 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2021-12-06 17:12:51,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2021-12-06 17:12:51,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-06 17:12:51,115 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:12:51,115 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:12:51,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-06 17:12:51,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:12:51,316 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:12:51,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:12:51,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522203, now seen corresponding path program 1 times [2021-12-06 17:12:51,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:12:51,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848179617] [2021-12-06 17:12:51,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:12:51,320 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:12:51,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:12:51,322 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:12:51,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-06 17:12:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:12:51,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 17:12:51,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:12:51,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:12:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 17:12:51,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:12:51,562 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:12:51,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848179617] [2021-12-06 17:12:51,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [848179617] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:12:51,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:12:51,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:12:51,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746904466] [2021-12-06 17:12:51,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:12:51,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:12:51,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:12:51,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:12:51,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:12:51,563 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:52,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:12:52,005 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2021-12-06 17:12:52,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:12:52,006 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-06 17:12:52,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:12:52,006 INFO L225 Difference]: With dead ends: 99 [2021-12-06 17:12:52,006 INFO L226 Difference]: Without dead ends: 99 [2021-12-06 17:12:52,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:12:52,007 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 311 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:12:52,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 111 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:12:52,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-06 17:12:52,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 83. [2021-12-06 17:12:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 82 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2021-12-06 17:12:52,010 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 41 [2021-12-06 17:12:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:12:52,011 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2021-12-06 17:12:52,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2021-12-06 17:12:52,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-06 17:12:52,011 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:12:52,011 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:12:52,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-12-06 17:12:52,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:12:52,213 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:12:52,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:12:52,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522204, now seen corresponding path program 1 times [2021-12-06 17:12:52,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:12:52,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671130568] [2021-12-06 17:12:52,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:12:52,216 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:12:52,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:12:52,218 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:12:52,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-06 17:12:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:12:52,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-06 17:12:52,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:12:52,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:12:52,511 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 17:12:52,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:12:52,511 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:12:52,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671130568] [2021-12-06 17:12:52,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671130568] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:12:52,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:12:52,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:12:52,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561675383] [2021-12-06 17:12:52,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:12:52,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:12:52,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:12:52,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:12:52,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:12:52,513 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:53,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:12:53,022 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2021-12-06 17:12:53,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:12:53,024 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-06 17:12:53,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:12:53,024 INFO L225 Difference]: With dead ends: 107 [2021-12-06 17:12:53,024 INFO L226 Difference]: Without dead ends: 107 [2021-12-06 17:12:53,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:12:53,025 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 413 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:12:53,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 80 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:12:53,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-06 17:12:53,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2021-12-06 17:12:53,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 82 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:53,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2021-12-06 17:12:53,027 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 41 [2021-12-06 17:12:53,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:12:53,028 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2021-12-06 17:12:53,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:12:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2021-12-06 17:12:53,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-06 17:12:53,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:12:53,028 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:12:53,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-06 17:12:53,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:12:53,230 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:12:53,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:12:53,231 INFO L85 PathProgramCache]: Analyzing trace with hash -333530929, now seen corresponding path program 1 times [2021-12-06 17:12:53,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:12:53,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493380291] [2021-12-06 17:12:53,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:12:53,234 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:12:53,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:12:53,235 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:12:53,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-06 17:12:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:12:53,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-06 17:12:53,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:12:53,440 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-06 17:12:53,440 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 21 [2021-12-06 17:12:53,538 INFO L354 Elim1Store]: treesize reduction 9, result has 64.0 percent of original size [2021-12-06 17:12:53,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 33 [2021-12-06 17:12:53,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:12:53,918 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:12:53,918 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-06 17:12:54,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:12:54,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:12:54,060 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-06 17:12:54,060 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 35 treesize of output 37 [2021-12-06 17:12:54,148 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 31 treesize of output 19 [2021-12-06 17:12:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 17:12:54,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:12:56,548 INFO L354 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2021-12-06 17:12:56,548 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 31 treesize of output 30 [2021-12-06 17:12:56,558 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_615) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) is different from false [2021-12-06 17:12:56,575 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_615) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))))) is different from false [2021-12-06 17:12:56,589 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_615) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))))) is different from false [2021-12-06 17:12:56,609 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_615) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2021-12-06 17:12:56,620 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_#res#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_615) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))))) is different from false [2021-12-06 17:12:56,630 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_615) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) .cse0)))) is different from false [2021-12-06 17:12:56,651 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_615) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))))) is different from false [2021-12-06 17:12:56,661 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:12:56,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-06 17:12:56,665 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 36 treesize of output 24 [2021-12-06 17:12:56,669 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 7 treesize of output 3 [2021-12-06 17:12:57,103 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 9 not checked. [2021-12-06 17:12:57,103 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:12:57,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493380291] [2021-12-06 17:12:57,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493380291] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:12:57,104 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:12:57,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2021-12-06 17:12:57,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595627739] [2021-12-06 17:12:57,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:12:57,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-06 17:12:57,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:12:57,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-06 17:12:57,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=919, Unknown=8, NotChecked=462, Total=1482 [2021-12-06 17:12:57,106 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 39 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:02,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:13:02,186 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2021-12-06 17:13:02,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-06 17:13:02,187 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 39 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-06 17:13:02,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:13:02,187 INFO L225 Difference]: With dead ends: 136 [2021-12-06 17:13:02,188 INFO L226 Difference]: Without dead ends: 136 [2021-12-06 17:13:02,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=482, Invalid=2400, Unknown=8, NotChecked=770, Total=3660 [2021-12-06 17:13:02,189 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 261 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 589 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:13:02,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 810 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 986 Invalid, 0 Unknown, 589 Unchecked, 2.3s Time] [2021-12-06 17:13:02,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-06 17:13:02,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2021-12-06 17:13:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.35) internal successors, (108), 90 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2021-12-06 17:13:02,195 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 44 [2021-12-06 17:13:02,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:13:02,195 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2021-12-06 17:13:02,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 39 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:02,196 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2021-12-06 17:13:02,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-06 17:13:02,196 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:13:02,196 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:13:02,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-12-06 17:13:02,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:13:02,397 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:13:02,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:13:02,399 INFO L85 PathProgramCache]: Analyzing trace with hash -333530928, now seen corresponding path program 1 times [2021-12-06 17:13:02,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:13:02,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62967868] [2021-12-06 17:13:02,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:13:02,401 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:13:02,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:13:02,403 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:13:02,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-06 17:13:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:13:02,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 55 conjunts are in the unsatisfiable core [2021-12-06 17:13:02,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:13:02,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:13:02,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:13:02,792 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:13:02,792 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 19 treesize of output 19 [2021-12-06 17:13:02,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-06 17:13:02,950 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-12-06 17:13:02,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:13:03,575 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:13:03,575 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2021-12-06 17:13:03,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:13:03,583 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 20 treesize of output 22 [2021-12-06 17:13:03,683 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 24 [2021-12-06 17:13:03,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-06 17:13:03,862 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 25 treesize of output 13 [2021-12-06 17:13:03,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:13:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 17:13:03,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:13:05,332 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_678) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_678) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_677) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2021-12-06 17:13:05,379 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_678) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_677) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_678) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2021-12-06 17:13:05,416 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_update_at_~head#1.offset|))) (.cse1 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_678) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_677) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_678) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) is different from false [2021-12-06 17:13:05,469 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_678) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_678) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_677) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))))))) is different from false [2021-12-06 17:13:05,502 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_#res#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) v_ArrVal_678) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_#res#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_678) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_677) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3))))))) is different from false [2021-12-06 17:13:05,532 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_678) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_677) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1)))))) (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) v_ArrVal_678) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3)))) (bvule .cse2 (bvadd .cse2 (_ bv4 32)))))) is different from false [2021-12-06 17:13:05,590 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_678) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_677) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)))))) (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3) v_ArrVal_678) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3)))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) is different from false [2021-12-06 17:13:05,610 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:13:05,610 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 1 case distinctions, treesize of input 43 treesize of output 34 [2021-12-06 17:13:05,613 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 50 treesize of output 32 [2021-12-06 17:13:05,623 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 17 treesize of output 9 [2021-12-06 17:13:05,650 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:13:05,650 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 1 case distinctions, treesize of input 45 treesize of output 46 [2021-12-06 17:13:05,661 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:13:05,662 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 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-06 17:13:05,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:13:05,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-12-06 17:13:05,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:13:05,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2021-12-06 17:13:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 9 not checked. [2021-12-06 17:13:07,372 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:13:07,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62967868] [2021-12-06 17:13:07,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62967868] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:13:07,372 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:13:07,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 37 [2021-12-06 17:13:07,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206995655] [2021-12-06 17:13:07,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:13:07,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-06 17:13:07,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:13:07,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-06 17:13:07,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=858, Unknown=7, NotChecked=448, Total=1406 [2021-12-06 17:13:07,373 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 38 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:12,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:13:12,631 INFO L93 Difference]: Finished difference Result 142 states and 158 transitions. [2021-12-06 17:13:12,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-06 17:13:12,631 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 38 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-06 17:13:12,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:13:12,633 INFO L225 Difference]: With dead ends: 142 [2021-12-06 17:13:12,633 INFO L226 Difference]: Without dead ends: 142 [2021-12-06 17:13:12,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=262, Invalid=1829, Unknown=7, NotChecked=658, Total=2756 [2021-12-06 17:13:12,634 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 249 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1093 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:13:12,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 1112 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 691 Invalid, 0 Unknown, 1093 Unchecked, 2.1s Time] [2021-12-06 17:13:12,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-06 17:13:12,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 90. [2021-12-06 17:13:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 89 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:12,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2021-12-06 17:13:12,638 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 44 [2021-12-06 17:13:12,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:13:12,638 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2021-12-06 17:13:12,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 38 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2021-12-06 17:13:12,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-06 17:13:12,638 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:13:12,639 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:13:12,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2021-12-06 17:13:12,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:13:12,840 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:13:12,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:13:12,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1958848316, now seen corresponding path program 2 times [2021-12-06 17:13:12,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:13:12,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953908645] [2021-12-06 17:13:12,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 17:13:12,843 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:13:12,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:13:12,845 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:13:12,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-06 17:13:12,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 17:13:12,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:13:12,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 17:13:12,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:13:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 17:13:13,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:13:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 17:13:13,343 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:13:13,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953908645] [2021-12-06 17:13:13,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953908645] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:13:13,343 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:13:13,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-06 17:13:13,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751684337] [2021-12-06 17:13:13,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:13:13,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 17:13:13,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:13:13,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 17:13:13,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:13:13,344 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:13,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:13:13,655 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2021-12-06 17:13:13,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 17:13:13,655 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-12-06 17:13:13,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:13:13,656 INFO L225 Difference]: With dead ends: 141 [2021-12-06 17:13:13,656 INFO L226 Difference]: Without dead ends: 141 [2021-12-06 17:13:13,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2021-12-06 17:13:13,657 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 295 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:13:13,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 270 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:13:13,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-06 17:13:13,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 89. [2021-12-06 17:13:13,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 88 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2021-12-06 17:13:13,660 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 47 [2021-12-06 17:13:13,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:13:13,660 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2021-12-06 17:13:13,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:13,660 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2021-12-06 17:13:13,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-06 17:13:13,661 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:13:13,661 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:13:13,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2021-12-06 17:13:13,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:13:13,862 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:13:13,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:13:13,863 INFO L85 PathProgramCache]: Analyzing trace with hash -645325999, now seen corresponding path program 1 times [2021-12-06 17:13:13,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:13:13,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662620570] [2021-12-06 17:13:13,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:13:13,865 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:13:13,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:13:13,867 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:13:13,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-06 17:13:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:13:14,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-06 17:13:14,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:13:14,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:13:14,289 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:13:14,289 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 16 treesize of output 16 [2021-12-06 17:13:14,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:13:14,440 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-12-06 17:13:15,152 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:13:15,152 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 63 [2021-12-06 17:13:15,158 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 33 treesize of output 23 [2021-12-06 17:13:15,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:13:15,164 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 43 treesize of output 43 [2021-12-06 17:13:15,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:13:15,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:13:15,491 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2021-12-06 17:13:15,498 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 30 treesize of output 32 [2021-12-06 17:13:15,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:13:15,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:13:15,505 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2021-12-06 17:13:15,949 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 35 treesize of output 23 [2021-12-06 17:13:15,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2021-12-06 17:13:16,191 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 19 treesize of output 11 [2021-12-06 17:13:16,551 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 17:13:16,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:13:17,511 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (_ BitVec 32)) (v_ArrVal_799 (_ BitVec 32))) (= (bvadd (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_796) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_799)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_800)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (_ bv1 32)) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-06 17:13:17,542 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (_ BitVec 32)) (v_ArrVal_799 (_ BitVec 32))) (= (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|) (bvadd (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_796) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_799) .cse0)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_800) .cse0))) (_ bv1 32)))) is different from false [2021-12-06 17:13:17,569 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:13:17,569 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 1 case distinctions, treesize of input 46 treesize of output 47 [2021-12-06 17:13:17,592 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:13:17,592 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 98 treesize of output 101 [2021-12-06 17:13:17,602 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 37 treesize of output 23 [2021-12-06 17:13:17,737 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_792) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_799) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_~s~0#1.base|))) (= (bvadd |c_ULTIMATE.start_sll_update_at_~data#1| (_ bv1 32)) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (_ BitVec 32))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_794) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_800) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_792) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_799) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_sll_update_at_~head#1.base|))) is different from false [2021-12-06 17:13:17,792 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvadd |c_ULTIMATE.start_sll_update_at_~data#1| (_ bv1 32)) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (_ BitVec 32))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_794) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_800) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|)) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_792) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_799) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base|)) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_792) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_799) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2021-12-06 17:13:17,827 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_792) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_799) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))))) (= (bvadd |c_ULTIMATE.start_sll_update_at_~data#1| (_ bv1 32)) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_792) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_799) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_update_at_~head#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1) v_ArrVal_794) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_800) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1))))) is different from false [2021-12-06 17:13:17,888 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~len~0#1| (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv1 32))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (_ BitVec 32))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_794) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_800) .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_792) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_799) .cse2))))) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_792) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_799) .cse3)))))) is different from false [2021-12-06 17:13:17,914 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_#res#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_792) |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset| v_ArrVal_799) .cse1))))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_#res#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) v_ArrVal_794) |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset| v_ArrVal_800) .cse2)))) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_#res#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) v_ArrVal_792) |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset| v_ArrVal_799) .cse3)))))) is different from false [2021-12-06 17:13:17,938 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (_ BitVec 32))) (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) v_ArrVal_794) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_800) .cse0)))) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (let ((.cse2 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_792) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_799) .cse2))))) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (let ((.cse3 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) v_ArrVal_792) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_799) .cse3)))))) is different from false [2021-12-06 17:13:17,994 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) v_ArrVal_792) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_799) .cse0))))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) v_ArrVal_794) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_800) .cse1)))) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (_ BitVec 32))) (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_792) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_799) .cse3)))))) is different from false [2021-12-06 17:13:18,008 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:13:18,008 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 1 case distinctions, treesize of input 26 treesize of output 27 [2021-12-06 17:13:18,011 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 45 treesize of output 41 [2021-12-06 17:13:18,014 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:13:18,017 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 29 treesize of output 25 [2021-12-06 17:13:18,020 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 49 treesize of output 41 [2021-12-06 17:13:18,039 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-06 17:13:18,039 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 1 case distinctions, treesize of input 25 treesize of output 1 [2021-12-06 17:13:18,048 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-06 17:13:18,048 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 1 case distinctions, treesize of input 25 treesize of output 1 [2021-12-06 17:13:18,743 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-06 17:13:18,743 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:13:18,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662620570] [2021-12-06 17:13:18,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662620570] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:13:18,743 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:13:18,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 49 [2021-12-06 17:13:18,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796902023] [2021-12-06 17:13:18,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:13:18,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-06 17:13:18,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:13:18,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-06 17:13:18,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1472, Unknown=9, NotChecked=756, Total=2352 [2021-12-06 17:13:18,745 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 49 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 49 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:13:22,722 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2021-12-06 17:13:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-06 17:13:22,723 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 49 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-12-06 17:13:22,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:13:22,724 INFO L225 Difference]: With dead ends: 89 [2021-12-06 17:13:22,724 INFO L226 Difference]: Without dead ends: 89 [2021-12-06 17:13:22,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=261, Invalid=2522, Unknown=9, NotChecked=990, Total=3782 [2021-12-06 17:13:22,725 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 58 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 367 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:13:22,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 1156 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 546 Invalid, 0 Unknown, 367 Unchecked, 1.4s Time] [2021-12-06 17:13:22,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-06 17:13:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-12-06 17:13:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 88 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2021-12-06 17:13:22,729 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 48 [2021-12-06 17:13:22,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:13:22,729 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2021-12-06 17:13:22,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 49 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2021-12-06 17:13:22,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-06 17:13:22,730 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:13:22,730 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:13:22,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-06 17:13:22,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:13:22,931 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:13:22,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:13:22,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1693462380, now seen corresponding path program 1 times [2021-12-06 17:13:22,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:13:22,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363265382] [2021-12-06 17:13:22,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:13:22,934 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:13:22,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:13:22,935 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:13:22,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-06 17:13:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:13:23,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-06 17:13:23,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:13:23,372 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 15 treesize of output 11 [2021-12-06 17:13:23,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:13:23,722 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-06 17:13:23,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:13:24,047 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 36 treesize of output 32 [2021-12-06 17:13:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-06 17:13:24,265 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:13:24,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363265382] [2021-12-06 17:13:24,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363265382] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:13:24,265 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:13:24,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2021-12-06 17:13:24,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430681046] [2021-12-06 17:13:24,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:13:24,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-06 17:13:24,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:13:24,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-06 17:13:24,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2021-12-06 17:13:24,267 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 23 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:25,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:13:25,331 INFO L93 Difference]: Finished difference Result 183 states and 197 transitions. [2021-12-06 17:13:25,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 17:13:25,333 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 23 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-12-06 17:13:25,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:13:25,333 INFO L225 Difference]: With dead ends: 183 [2021-12-06 17:13:25,334 INFO L226 Difference]: Without dead ends: 183 [2021-12-06 17:13:25,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=196, Invalid=796, Unknown=0, NotChecked=0, Total=992 [2021-12-06 17:13:25,334 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 414 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 17:13:25,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [414 Valid, 707 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 17:13:25,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-06 17:13:25,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 111. [2021-12-06 17:13:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 100 states have (on average 1.2) internal successors, (120), 110 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:25,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2021-12-06 17:13:25,337 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 55 [2021-12-06 17:13:25,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:13:25,338 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2021-12-06 17:13:25,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 23 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2021-12-06 17:13:25,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-06 17:13:25,338 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:13:25,338 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:13:25,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-12-06 17:13:25,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:13:25,540 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:13:25,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:13:25,541 INFO L85 PathProgramCache]: Analyzing trace with hash 261778123, now seen corresponding path program 2 times [2021-12-06 17:13:25,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:13:25,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730293392] [2021-12-06 17:13:25,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 17:13:25,543 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:13:25,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:13:25,544 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:13:25,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-06 17:13:25,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 17:13:25,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:13:25,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 17:13:25,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:13:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 17:13:25,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:13:26,142 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 17:13:26,142 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:13:26,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730293392] [2021-12-06 17:13:26,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730293392] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:13:26,143 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:13:26,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-06 17:13:26,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189560979] [2021-12-06 17:13:26,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:13:26,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 17:13:26,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:13:26,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 17:13:26,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:13:26,144 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:26,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:13:26,315 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2021-12-06 17:13:26,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:13:26,315 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-12-06 17:13:26,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:13:26,316 INFO L225 Difference]: With dead ends: 96 [2021-12-06 17:13:26,316 INFO L226 Difference]: Without dead ends: 96 [2021-12-06 17:13:26,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-12-06 17:13:26,317 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 192 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:13:26,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 156 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:13:26,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-06 17:13:26,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2021-12-06 17:13:26,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 88 states have (on average 1.125) internal successors, (99), 94 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:26,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2021-12-06 17:13:26,320 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 58 [2021-12-06 17:13:26,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:13:26,320 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2021-12-06 17:13:26,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:26,320 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2021-12-06 17:13:26,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 17:13:26,321 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:13:26,321 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:13:26,330 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2021-12-06 17:13:26,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:13:26,522 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:13:26,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:13:26,523 INFO L85 PathProgramCache]: Analyzing trace with hash 187254194, now seen corresponding path program 1 times [2021-12-06 17:13:26,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:13:26,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463159600] [2021-12-06 17:13:26,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:13:26,525 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:13:26,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:13:26,526 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:13:26,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-06 17:13:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:13:26,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 17:13:26,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:13:26,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:13:26,876 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 17:13:26,876 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:13:26,876 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:13:26,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463159600] [2021-12-06 17:13:26,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463159600] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:13:26,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:13:26,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:13:26,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803526423] [2021-12-06 17:13:26,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:13:26,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:13:26,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:13:26,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:13:26,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:13:26,878 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:27,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:13:27,432 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2021-12-06 17:13:27,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:13:27,433 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-12-06 17:13:27,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:13:27,433 INFO L225 Difference]: With dead ends: 106 [2021-12-06 17:13:27,433 INFO L226 Difference]: Without dead ends: 106 [2021-12-06 17:13:27,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:13:27,434 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 236 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:13:27,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 93 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:13:27,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-06 17:13:27,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2021-12-06 17:13:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 90 states have (on average 1.1333333333333333) internal successors, (102), 95 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2021-12-06 17:13:27,437 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 59 [2021-12-06 17:13:27,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:13:27,437 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2021-12-06 17:13:27,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:27,437 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2021-12-06 17:13:27,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 17:13:27,438 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:13:27,438 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:13:27,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-06 17:13:27,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:13:27,639 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:13:27,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:13:27,640 INFO L85 PathProgramCache]: Analyzing trace with hash 187254195, now seen corresponding path program 1 times [2021-12-06 17:13:27,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:13:27,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [946684813] [2021-12-06 17:13:27,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:13:27,642 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:13:27,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:13:27,644 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:13:27,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-06 17:13:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:13:27,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-06 17:13:27,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:13:27,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:13:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 17:13:28,233 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:13:28,233 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:13:28,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [946684813] [2021-12-06 17:13:28,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [946684813] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:13:28,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:13:28,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:13:28,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609748106] [2021-12-06 17:13:28,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:13:28,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:13:28,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:13:28,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:13:28,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:13:28,235 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:28,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:13:28,822 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2021-12-06 17:13:28,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:13:28,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-12-06 17:13:28,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:13:28,823 INFO L225 Difference]: With dead ends: 104 [2021-12-06 17:13:28,823 INFO L226 Difference]: Without dead ends: 104 [2021-12-06 17:13:28,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:13:28,823 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 295 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:13:28,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 56 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:13:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-06 17:13:28,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2021-12-06 17:13:28,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 92 states have (on average 1.1195652173913044) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:28,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2021-12-06 17:13:28,826 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 59 [2021-12-06 17:13:28,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:13:28,826 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2021-12-06 17:13:28,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2021-12-06 17:13:28,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-06 17:13:28,827 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:13:28,827 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:13:28,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-06 17:13:29,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:13:29,029 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:13:29,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:13:29,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1509911310, now seen corresponding path program 1 times [2021-12-06 17:13:29,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:13:29,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108727930] [2021-12-06 17:13:29,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:13:29,032 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:13:29,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:13:29,034 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:13:29,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-06 17:13:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:13:29,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 17:13:29,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:13:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 17:13:29,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:13:29,387 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:13:29,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108727930] [2021-12-06 17:13:29,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108727930] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:13:29,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:13:29,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 17:13:29,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448360077] [2021-12-06 17:13:29,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:13:29,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:13:29,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:13:29,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:13:29,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:13:29,389 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:29,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:13:29,761 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2021-12-06 17:13:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:13:29,761 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-12-06 17:13:29,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:13:29,762 INFO L225 Difference]: With dead ends: 101 [2021-12-06 17:13:29,762 INFO L226 Difference]: Without dead ends: 101 [2021-12-06 17:13:29,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:13:29,763 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 277 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:13:29,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 85 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:13:29,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-06 17:13:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2021-12-06 17:13:29,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 92 states have (on average 1.108695652173913) internal successors, (102), 97 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2021-12-06 17:13:29,765 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 60 [2021-12-06 17:13:29,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:13:29,765 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2021-12-06 17:13:29,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:29,765 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2021-12-06 17:13:29,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-06 17:13:29,766 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:13:29,766 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:13:29,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-12-06 17:13:29,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:13:29,967 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:13:29,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:13:29,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1058733960, now seen corresponding path program 3 times [2021-12-06 17:13:29,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:13:29,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928447071] [2021-12-06 17:13:29,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 17:13:29,970 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:13:29,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:13:29,973 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:13:29,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-06 17:13:30,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-06 17:13:30,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:13:30,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-06 17:13:30,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:13:30,353 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-12-06 17:13:30,918 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 27 treesize of output 15 [2021-12-06 17:13:31,190 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-06 17:13:31,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:13:32,111 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 36 treesize of output 32 [2021-12-06 17:13:32,164 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 36 treesize of output 32 [2021-12-06 17:13:32,604 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-06 17:13:32,604 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:13:32,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928447071] [2021-12-06 17:13:32,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928447071] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:13:32,604 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:13:32,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-12-06 17:13:32,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784662389] [2021-12-06 17:13:32,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:13:32,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-06 17:13:32,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:13:32,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-06 17:13:32,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2021-12-06 17:13:32,606 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:35,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:13:35,809 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2021-12-06 17:13:35,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-06 17:13:35,811 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-12-06 17:13:35,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:13:35,811 INFO L225 Difference]: With dead ends: 96 [2021-12-06 17:13:35,812 INFO L226 Difference]: Without dead ends: 96 [2021-12-06 17:13:35,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=208, Invalid=914, Unknown=0, NotChecked=0, Total=1122 [2021-12-06 17:13:35,813 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 175 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:13:35,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 399 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-06 17:13:35,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-06 17:13:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 74. [2021-12-06 17:13:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2021-12-06 17:13:35,816 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 60 [2021-12-06 17:13:35,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:13:35,816 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2021-12-06 17:13:35,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:35,816 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2021-12-06 17:13:35,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-06 17:13:35,817 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:13:35,817 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:13:35,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2021-12-06 17:13:36,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:13:36,019 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:13:36,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:13:36,020 INFO L85 PathProgramCache]: Analyzing trace with hash -672727665, now seen corresponding path program 1 times [2021-12-06 17:13:36,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:13:36,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574037476] [2021-12-06 17:13:36,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:13:36,022 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:13:36,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:13:36,024 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:13:36,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-06 17:13:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:13:36,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-06 17:13:36,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:13:37,283 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 17:13:37,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:13:37,283 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:13:37,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574037476] [2021-12-06 17:13:37,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574037476] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:13:37,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:13:37,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 17:13:37,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587328188] [2021-12-06 17:13:37,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:13:37,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 17:13:37,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:13:37,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 17:13:37,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-12-06 17:13:37,285 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:37,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:13:37,365 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2021-12-06 17:13:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 17:13:37,365 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-06 17:13:37,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:13:37,366 INFO L225 Difference]: With dead ends: 76 [2021-12-06 17:13:37,366 INFO L226 Difference]: Without dead ends: 76 [2021-12-06 17:13:37,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-06 17:13:37,367 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 31 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:13:37,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 249 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 48 Unchecked, 0.0s Time] [2021-12-06 17:13:37,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-06 17:13:37,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2021-12-06 17:13:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:37,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2021-12-06 17:13:37,369 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 62 [2021-12-06 17:13:37,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:13:37,369 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2021-12-06 17:13:37,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:37,369 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2021-12-06 17:13:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 17:13:37,370 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:13:37,370 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:13:37,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2021-12-06 17:13:37,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:13:37,571 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:13:37,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:13:37,572 INFO L85 PathProgramCache]: Analyzing trace with hash -912303337, now seen corresponding path program 1 times [2021-12-06 17:13:37,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:13:37,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120230973] [2021-12-06 17:13:37,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:13:37,574 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:13:37,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:13:37,576 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:13:37,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-12-06 17:13:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:13:37,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 51 conjunts are in the unsatisfiable core [2021-12-06 17:13:37,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:13:37,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:13:38,016 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 17:13:38,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2021-12-06 17:13:38,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:13:38,901 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:13:38,901 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2021-12-06 17:13:39,057 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 34 treesize of output 29 [2021-12-06 17:13:39,679 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 32 treesize of output 20 [2021-12-06 17:13:39,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2021-12-06 17:13:40,010 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-06 17:13:40,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:13:45,867 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:13:45,868 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 1 case distinctions, treesize of input 42 treesize of output 43 [2021-12-06 17:13:45,872 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 76 treesize of output 64 [2021-12-06 17:13:45,876 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 31 treesize of output 27 [2021-12-06 17:13:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-06 17:13:46,324 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:13:46,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120230973] [2021-12-06 17:13:46,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120230973] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:13:46,325 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:13:46,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 37 [2021-12-06 17:13:46,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310642664] [2021-12-06 17:13:46,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:13:46,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-06 17:13:46,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:13:46,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-06 17:13:46,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1292, Unknown=2, NotChecked=0, Total=1406 [2021-12-06 17:13:46,326 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 38 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:13:47,423 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2021-12-06 17:13:47,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 17:13:47,423 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 38 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-12-06 17:13:47,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:13:47,424 INFO L225 Difference]: With dead ends: 88 [2021-12-06 17:13:47,424 INFO L226 Difference]: Without dead ends: 88 [2021-12-06 17:13:47,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 88 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=183, Invalid=1977, Unknown=2, NotChecked=0, Total=2162 [2021-12-06 17:13:47,425 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 42 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 392 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:13:47,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 682 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 392 Unchecked, 0.2s Time] [2021-12-06 17:13:47,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-06 17:13:47,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2021-12-06 17:13:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2021-12-06 17:13:47,428 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 65 [2021-12-06 17:13:47,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:13:47,428 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2021-12-06 17:13:47,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 38 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:13:47,428 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2021-12-06 17:13:47,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 17:13:47,428 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:13:47,429 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:13:47,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2021-12-06 17:13:47,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:13:47,630 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:13:47,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:13:47,631 INFO L85 PathProgramCache]: Analyzing trace with hash -912303336, now seen corresponding path program 1 times [2021-12-06 17:13:47,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:13:47,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423742127] [2021-12-06 17:13:47,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:13:47,633 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:13:47,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:13:47,635 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:13:47,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-06 17:13:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:13:47,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 61 conjunts are in the unsatisfiable core [2021-12-06 17:13:47,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:13:47,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:13:48,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:13:48,180 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:13:48,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-06 17:13:48,202 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:13:48,202 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 20 treesize of output 20 [2021-12-06 17:13:48,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:13:48,425 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-12-06 17:13:49,005 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:13:49,006 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2021-12-06 17:13:49,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:13:49,012 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 20 treesize of output 22 [2021-12-06 17:13:49,106 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 24 [2021-12-06 17:13:49,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-06 17:13:49,569 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 25 treesize of output 13 [2021-12-06 17:13:49,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:13:49,793 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-06 17:13:49,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:13:51,725 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1298) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) (forall ((v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2021-12-06 17:13:51,774 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1298) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2021-12-06 17:13:51,809 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_update_at_~head#1.offset|))) (.cse1 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1298) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) (forall ((v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2021-12-06 17:13:51,858 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1298) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_1299) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3)))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2021-12-06 17:13:51,894 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_#res#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1299) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1298) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1)))))) (forall ((v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_#res#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) v_ArrVal_1299) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3)))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))) is different from false [2021-12-06 17:13:51,928 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) v_ArrVal_1299) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1299) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1298) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))))))) is different from false [2021-12-06 17:13:51,990 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1299) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1299) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1298) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))))))) is different from false [2021-12-06 17:13:52,005 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:13:52,006 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 1 case distinctions, treesize of input 45 treesize of output 36 [2021-12-06 17:13:52,008 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 54 treesize of output 36 [2021-12-06 17:13:52,017 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 19 treesize of output 11 [2021-12-06 17:13:52,040 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:13:52,041 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 1 case distinctions, treesize of input 45 treesize of output 46 [2021-12-06 17:13:52,053 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:13:52,054 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 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-06 17:13:52,057 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:13:52,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-12-06 17:13:52,065 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:13:52,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2021-12-06 17:13:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 9 not checked. [2021-12-06 17:13:54,046 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:13:54,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423742127] [2021-12-06 17:13:54,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423742127] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:13:54,046 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:13:54,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 39 [2021-12-06 17:13:54,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615802105] [2021-12-06 17:13:54,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:13:54,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-06 17:13:54,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:13:54,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-06 17:13:54,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=979, Unknown=7, NotChecked=476, Total=1560 [2021-12-06 17:13:54,048 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 40 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 40 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:01,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:01,001 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2021-12-06 17:14:01,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-06 17:14:01,002 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 40 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-12-06 17:14:01,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:01,002 INFO L225 Difference]: With dead ends: 93 [2021-12-06 17:14:01,003 INFO L226 Difference]: Without dead ends: 93 [2021-12-06 17:14:01,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 89 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=363, Invalid=2520, Unknown=7, NotChecked=770, Total=3660 [2021-12-06 17:14:01,004 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 129 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 673 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-06 17:14:01,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 489 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 792 Invalid, 0 Unknown, 673 Unchecked, 2.7s Time] [2021-12-06 17:14:01,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-06 17:14:01,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 80. [2021-12-06 17:14:01,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.12) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:01,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2021-12-06 17:14:01,006 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 65 [2021-12-06 17:14:01,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:01,006 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2021-12-06 17:14:01,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 40 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2021-12-06 17:14:01,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-06 17:14:01,007 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:01,007 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:14:01,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2021-12-06 17:14:01,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:14:01,208 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:14:01,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:01,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1783366217, now seen corresponding path program 1 times [2021-12-06 17:14:01,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:01,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922941140] [2021-12-06 17:14:01,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:14:01,211 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:01,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:01,213 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:01,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-12-06 17:14:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:14:01,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-06 17:14:01,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:01,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-06 17:14:01,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-06 17:14:01,953 INFO L354 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2021-12-06 17:14:01,953 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 20 treesize of output 20 [2021-12-06 17:14:02,102 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 16 treesize of output 8 [2021-12-06 17:14:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-06 17:14:02,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:14:02,476 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:14:02,476 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 25 treesize of output 28 [2021-12-06 17:14:02,720 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-06 17:14:02,720 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:02,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922941140] [2021-12-06 17:14:02,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922941140] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:14:02,720 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:14:02,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 21 [2021-12-06 17:14:02,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218127636] [2021-12-06 17:14:02,721 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:14:02,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-06 17:14:02,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:14:02,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-06 17:14:02,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-12-06 17:14:02,722 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 22 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 21 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:04,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:04,598 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2021-12-06 17:14:04,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-06 17:14:04,599 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 21 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-12-06 17:14:04,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:04,600 INFO L225 Difference]: With dead ends: 80 [2021-12-06 17:14:04,600 INFO L226 Difference]: Without dead ends: 80 [2021-12-06 17:14:04,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 107 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=392, Invalid=1168, Unknown=0, NotChecked=0, Total=1560 [2021-12-06 17:14:04,601 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 410 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-06 17:14:04,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 232 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 387 Invalid, 0 Unknown, 35 Unchecked, 0.9s Time] [2021-12-06 17:14:04,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-06 17:14:04,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-12-06 17:14:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2021-12-06 17:14:04,603 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 66 [2021-12-06 17:14:04,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:04,603 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2021-12-06 17:14:04,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 21 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2021-12-06 17:14:04,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-06 17:14:04,603 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:04,603 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:14:04,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2021-12-06 17:14:04,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:14:04,805 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:14:04,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:04,806 INFO L85 PathProgramCache]: Analyzing trace with hash 124432906, now seen corresponding path program 1 times [2021-12-06 17:14:04,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:04,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347496513] [2021-12-06 17:14:04,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:14:04,808 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:04,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:04,809 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:04,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-12-06 17:14:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:14:05,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-06 17:14:05,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:05,127 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 17:14:05,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-06 17:14:05,445 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-06 17:14:05,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2021-12-06 17:14:05,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:14:06,420 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:14:06,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-06 17:14:06,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2021-12-06 17:14:07,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2021-12-06 17:14:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-06 17:14:07,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:14:08,600 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1415) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |c_#StackHeapBarrier|)) is different from false [2021-12-06 17:14:09,104 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1415) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) |c_#StackHeapBarrier|)) is different from false [2021-12-06 17:14:09,121 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_#res#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0) v_ArrVal_1415) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0)) |c_#StackHeapBarrier|)) is different from false [2021-12-06 17:14:09,138 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) v_ArrVal_1415) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0)) |c_#StackHeapBarrier|)) is different from false [2021-12-06 17:14:09,163 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) v_ArrVal_1415) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)) |c_#StackHeapBarrier|)) is different from false [2021-12-06 17:14:09,173 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:14:09,173 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 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-06 17:14:09,176 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 36 treesize of output 24 [2021-12-06 17:14:09,180 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 11 treesize of output 7 [2021-12-06 17:14:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 8 not checked. [2021-12-06 17:14:10,345 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:10,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347496513] [2021-12-06 17:14:10,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347496513] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:14:10,345 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:14:10,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 40 [2021-12-06 17:14:10,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218223441] [2021-12-06 17:14:10,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:14:10,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-06 17:14:10,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:14:10,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-06 17:14:10,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1134, Unknown=40, NotChecked=360, Total=1640 [2021-12-06 17:14:10,347 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 41 states, 40 states have (on average 2.925) internal successors, (117), 41 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:13,430 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2021-12-06 17:14:13,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-06 17:14:13,431 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.925) internal successors, (117), 41 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-12-06 17:14:13,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:13,432 INFO L225 Difference]: With dead ends: 82 [2021-12-06 17:14:13,432 INFO L226 Difference]: Without dead ends: 82 [2021-12-06 17:14:13,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=214, Invalid=2210, Unknown=46, NotChecked=500, Total=2970 [2021-12-06 17:14:13,433 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 45 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 408 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-06 17:14:13,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 673 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 374 Invalid, 0 Unknown, 408 Unchecked, 0.9s Time] [2021-12-06 17:14:13,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-06 17:14:13,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2021-12-06 17:14:13,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.105263157894737) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:13,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2021-12-06 17:14:13,435 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 68 [2021-12-06 17:14:13,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:13,435 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2021-12-06 17:14:13,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.925) internal successors, (117), 41 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:13,436 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2021-12-06 17:14:13,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-06 17:14:13,436 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:13,436 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:14:13,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2021-12-06 17:14:13,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:14:13,637 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:14:13,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:13,638 INFO L85 PathProgramCache]: Analyzing trace with hash 424087740, now seen corresponding path program 2 times [2021-12-06 17:14:13,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:13,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970787198] [2021-12-06 17:14:13,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 17:14:13,640 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:13,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:13,643 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:13,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-12-06 17:14:13,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 17:14:13,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:14:13,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 84 conjunts are in the unsatisfiable core [2021-12-06 17:14:13,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:13,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:14:14,125 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-12-06 17:14:14,133 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-12-06 17:14:14,250 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:14:14,250 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 15 treesize of output 15 [2021-12-06 17:14:14,333 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 16 treesize of output 18 [2021-12-06 17:14:14,342 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 16 treesize of output 18 [2021-12-06 17:14:14,364 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 16 treesize of output 18 [2021-12-06 17:14:14,371 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 16 treesize of output 18 [2021-12-06 17:14:14,508 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 21 treesize of output 20 [2021-12-06 17:14:14,513 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 26 [2021-12-06 17:14:15,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:14:15,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:14:15,315 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 17:14:15,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 67 [2021-12-06 17:14:15,321 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:14:15,336 INFO L354 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2021-12-06 17:14:15,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2021-12-06 17:14:15,517 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 17:14:15,517 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 42 treesize of output 39 [2021-12-06 17:14:15,523 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 0 case distinctions, treesize of input 25 treesize of output 25 [2021-12-06 17:14:16,791 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-12-06 17:14:16,791 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 57 treesize of output 38 [2021-12-06 17:14:16,812 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:14:16,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2021-12-06 17:14:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-06 17:14:17,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:14:18,760 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1489 (_ BitVec 32))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1490)) (.cse2 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (not (= (_ bv0 32) .cse0)) (= (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1489)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (bvadd (_ bv4 32) .cse0)) (_ bv0 32)))))) (forall ((v_ArrVal_1490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1489 (_ BitVec 32))) (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1490) |c_ULTIMATE.start_main_~s~0#1.base|) .cse5))) (or (not (= (_ bv0 32) .cse3)) (= (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1489)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse5))) (bvadd (_ bv4 32) .cse3)) (_ bv0 32))))))) is different from false [2021-12-06 17:14:18,819 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 39 treesize of output 31 [2021-12-06 17:14:34,438 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:14:34,439 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 72 [2021-12-06 17:14:34,459 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:14:34,459 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 62 [2021-12-06 17:14:34,674 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:14:34,675 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 75 [2021-12-06 17:14:37,919 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_42| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1487 (_ BitVec 32)) (v_ArrVal_1489 (_ BitVec 32)) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_16 (_ bv4 32)))) (= (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_arrayElimArr_16))) (store .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1487))))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) (_ bv0 32) v_ArrVal_1489))) (select (store .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_42| .cse1) (select .cse1 (_ bv4 32))))) (_ bv4 32)) (_ bv0 32)))) (forall ((v_ArrVal_1487 (_ BitVec 32)) (v_ArrVal_1490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1489 (_ BitVec 32)) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_15 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1486 (_ BitVec 32))) (let ((.cse5 (select v_ArrVal_1490 (_ bv4 32)))) (or (= (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_arrayElimArr_14))) (store .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1486))) |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_ArrVal_1490) (select (store (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_42| v_arrayElimArr_15))) (store .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1487))) |v_ULTIMATE.start_node_create_~temp~0#1.base_42|) (_ bv0 32) v_ArrVal_1489) (_ bv4 32))) (bvadd .cse5 (_ bv4 32))) (_ bv0 32)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_arrayElimArr_14 (_ bv4 32)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_15 (_ bv4 32)))) (not (= .cse5 (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_42|))))) is different from false [2021-12-06 17:14:44,507 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:14:44,508 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 1 case distinctions, treesize of input 240 treesize of output 231 [2021-12-06 17:14:44,544 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:14:44,545 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 1 case distinctions, treesize of input 231 treesize of output 161 [2021-12-06 17:14:44,588 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:14:44,588 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 4169 treesize of output 3996 [2021-12-06 17:14:44,818 INFO L354 Elim1Store]: treesize reduction 29, result has 67.0 percent of original size [2021-12-06 17:14:44,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 15191 treesize of output 14717 [2021-12-06 17:14:45,012 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 14818 treesize of output 14066 [2021-12-06 17:14:45,142 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:14:45,142 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13997 treesize of output 13754 [2021-12-06 17:14:45,355 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:14:45,356 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 13757 treesize of output 13732 [2021-12-06 17:14:45,479 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 13630 treesize of output 12742 [2021-12-06 17:14:45,687 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:45,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970787198] [2021-12-06 17:14:45,687 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-06 17:14:45,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1705307991] [2021-12-06 17:14:45,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 17:14:45,688 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 17:14:45,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 17:14:45,688 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 17:14:45,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2021-12-06 17:14:46,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 17:14:46,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:14:46,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 82 conjunts are in the unsatisfiable core [2021-12-06 17:14:46,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:46,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:14:46,162 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-12-06 17:14:46,171 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-12-06 17:14:46,227 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:14:46,228 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 15 treesize of output 15 [2021-12-06 17:14:46,268 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 16 treesize of output 18 [2021-12-06 17:14:46,279 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 16 treesize of output 18 [2021-12-06 17:14:46,299 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 16 treesize of output 18 [2021-12-06 17:14:46,310 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 16 treesize of output 18 [2021-12-06 17:14:46,371 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 21 treesize of output 20 [2021-12-06 17:14:46,378 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 26 [2021-12-06 17:14:46,618 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:14:46,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:14:46,622 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 17:14:46,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 67 [2021-12-06 17:14:46,627 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:14:46,641 INFO L354 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2021-12-06 17:14:46,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2021-12-06 17:14:46,821 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 17:14:46,821 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 42 treesize of output 39 [2021-12-06 17:14:46,826 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 0 case distinctions, treesize of input 25 treesize of output 25 [2021-12-06 17:14:48,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:14:48,647 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-12-06 17:14:48,647 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 69 treesize of output 46 [2021-12-06 17:14:48,665 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:14:48,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-06 17:14:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-06 17:14:48,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:14:49,142 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 26 treesize of output 24 [2021-12-06 17:16:19,835 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:16:19,835 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 122 [2021-12-06 17:16:19,849 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:16:19,849 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 123 [2021-12-06 17:16:19,901 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 8 treesize of output 4 [2021-12-06 17:16:20,223 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 8 treesize of output 4 [2021-12-06 17:16:20,516 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 8 treesize of output 4 [2021-12-06 17:16:23,696 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 8 treesize of output 4 [2021-12-06 17:16:23,981 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 8 treesize of output 4 [2021-12-06 17:16:24,247 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 8 treesize of output 4 [2021-12-06 17:16:24,512 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 8 treesize of output 4 [2021-12-06 17:16:24,791 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 6 treesize of output 4 [2021-12-06 17:16:25,347 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 6 treesize of output 4 [2021-12-06 17:16:25,611 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1560 (_ BitVec 32)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_43| (_ BitVec 32))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_43| v_arrayElimArr_20))) (store .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1560))))) (let ((.cse0 (select (select .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (_ bv4 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_43|))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_20 (_ bv4 32)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_arrayElimArr_19 (_ bv4 32)))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_43| .cse0) (and (forall ((v_ArrVal_1559 (_ BitVec 32))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_43| v_arrayElimArr_19))) (store .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1559))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_43| v_arrayElimArr_20))) (store .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1560))) |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) (select (select .cse3 .cse0) (_ bv4 32)))))))) is different from false [2021-12-06 17:16:25,635 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 6 treesize of output 4 [2021-12-06 17:16:26,151 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 6 treesize of output 4 [2021-12-06 17:16:26,740 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 73 treesize of output 65 [2021-12-06 17:16:27,027 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 73 treesize of output 65 [2021-12-06 17:16:27,446 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1560 (_ BitVec 32)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_43| (_ BitVec 32))) (let ((.cse0 (select v_arrayElimArr_19 (_ bv4 32)))) (let ((.cse1 (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_43| v_arrayElimArr_20))) (store .cse6 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0 v_ArrVal_1560))))) (let ((.cse2 (select (select .cse1 |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (_ bv4 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_43|))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select v_arrayElimArr_20 (_ bv4 32)))) (not (= .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (and (= (select (select .cse1 .cse2) (_ bv4 32)) (_ bv0 32)) (forall ((v_ArrVal_1559 (_ BitVec 32))) (= (select (let ((.cse4 (select v_arrayElimArr_19 (_ bv4 32)))) (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_43| v_arrayElimArr_19))) (store .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse4 v_ArrVal_1559))) (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_43| v_arrayElimArr_20))) (store .cse5 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse4 v_ArrVal_1560))) |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_43| .cse2)))))) is different from false [2021-12-06 17:16:27,486 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:16:27,486 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 1 case distinctions, treesize of input 211 treesize of output 141 [2021-12-06 17:16:27,504 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:16:27,504 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 1 case distinctions, treesize of input 141 treesize of output 131 [2021-12-06 17:16:27,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:16:27,613 INFO L354 Elim1Store]: treesize reduction 8, result has 79.5 percent of original size [2021-12-06 17:16:27,614 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 517 treesize of output 514 [2021-12-06 17:16:27,628 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 696 treesize of output 656 [2021-12-06 17:16:27,774 INFO L354 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2021-12-06 17:16:27,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1538 treesize of output 1518 [2021-12-06 17:16:27,794 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 1716 treesize of output 1470 [2021-12-06 17:20:00,084 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:20:00,084 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 67 treesize of output 69 [2021-12-06 17:20:00,255 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:20:00,255 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 34 treesize of output 38 [2021-12-06 17:20:01,987 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 4 not checked. [2021-12-06 17:20:01,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1705307991] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:20:01,987 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:20:01,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 51 [2021-12-06 17:20:01,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881388363] [2021-12-06 17:20:01,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:20:01,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-12-06 17:20:01,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:20:01,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-12-06 17:20:01,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=4470, Unknown=274, NotChecked=564, Total=5550 [2021-12-06 17:20:01,990 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 51 states, 51 states have (on average 2.3137254901960786) internal successors, (118), 51 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:20:06,291 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) (_ bv0 32)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) (_ bv0 32)) (forall ((v_ArrVal_1560 (_ BitVec 32))) (let ((.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse3 (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse8 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1560))))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) (and (= (_ bv0 32) (select (select .cse3 .cse2) (_ bv4 32))) (forall ((v_ArrVal_1559 (_ BitVec 32))) (= (select (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1559))) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1560))) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse5))) (_ bv4 32)) (_ bv0 32))))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) (_ bv0 32)) (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1560 (_ BitVec 32)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_43| (_ BitVec 32))) (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_43| v_arrayElimArr_20))) (store .cse13 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1560))))) (let ((.cse9 (select (select .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (_ bv4 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_43|))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_20 (_ bv4 32)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_arrayElimArr_19 (_ bv4 32)))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_43| .cse9) (and (forall ((v_ArrVal_1559 (_ BitVec 32))) (= (select (select (let ((.cse10 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_43| v_arrayElimArr_19))) (store .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1559))) (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_43| v_arrayElimArr_20))) (store .cse11 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1560))) |v_ULTIMATE.start_node_create_~temp~0#1.base_43|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) (select (select .cse12 .cse9) (_ bv4 32)))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (_ bv1 1))))) is different from false [2021-12-06 17:20:12,298 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (and (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| .cse0) (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| .cse1) (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| .cse2) (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) (_ bv0 32)) (not (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) (_ bv4 32)) (_ bv0 32)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (_ bv0 32)) (not (= .cse1 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse4) (_ bv0 32)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) (_ bv4 32)) (_ bv0 32)) (forall ((v_ArrVal_1563 (_ BitVec 32))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1563)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))))) (or (= |c_ULTIMATE.start_main_~s~0#1.base| .cse5) (and (forall ((v_ArrVal_1564 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1564) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1563)) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (_ bv4 32)))) (= (select (select .cse6 .cse5) (_ bv4 32)) (_ bv0 32))))))) (= (select (select |c_#memory_$Pointer$.offset| .cse2) (_ bv4 32)) (_ bv0 32))))) is different from false [2021-12-06 17:20:18,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:20:18,114 INFO L93 Difference]: Finished difference Result 178 states and 185 transitions. [2021-12-06 17:20:18,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-12-06 17:20:18,115 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.3137254901960786) internal successors, (118), 51 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-12-06 17:20:18,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:20:18,116 INFO L225 Difference]: With dead ends: 178 [2021-12-06 17:20:18,116 INFO L226 Difference]: Without dead ends: 178 [2021-12-06 17:20:18,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 198 SyntacticMatches, 5 SemanticMatches, 103 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2234 ImplicationChecksByTransitivity, 133.7s TimeCoverageRelationStatistics Valid=650, Invalid=8712, Unknown=364, NotChecked=1194, Total=10920 [2021-12-06 17:20:18,121 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 154 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 961 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:20:18,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 1337 Invalid, 1815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 824 Invalid, 0 Unknown, 961 Unchecked, 2.4s Time] [2021-12-06 17:20:18,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-12-06 17:20:18,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 139. [2021-12-06 17:20:18,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 138 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:20:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 145 transitions. [2021-12-06 17:20:18,125 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 145 transitions. Word has length 71 [2021-12-06 17:20:18,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:20:18,125 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 145 transitions. [2021-12-06 17:20:18,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.3137254901960786) internal successors, (118), 51 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:20:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2021-12-06 17:20:18,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-06 17:20:18,126 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:20:18,126 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:20:18,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2021-12-06 17:20:18,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (34)] Ended with exit code 0 [2021-12-06 17:20:18,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:20:18,528 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-06 17:20:18,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:20:18,529 INFO L85 PathProgramCache]: Analyzing trace with hash 261816644, now seen corresponding path program 2 times [2021-12-06 17:20:18,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:20:18,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682050383] [2021-12-06 17:20:18,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 17:20:18,531 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:20:18,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:20:18,533 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:20:18,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7ff5680-3a39-45ce-909f-6401cbc1f059/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2021-12-06 17:20:19,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 17:20:19,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:20:19,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-06 17:20:19,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:20:19,544 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-12-06 17:20:20,395 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:20:20,395 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2021-12-06 17:20:20,606 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 55 treesize of output 46 [2021-12-06 17:20:21,324 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 51 treesize of output 35 [2021-12-06 17:20:24,451 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-06 17:20:24,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:20:27,336 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (_ BitVec 1)) (v_ArrVal_1628 (_ BitVec 1)) (v_ArrVal_1625 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg v_ArrVal_1628))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1628) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1625) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) v_ArrVal_1629) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (_ bv0 1) (bvneg (bvneg v_ArrVal_1629)))))) is different from false [2021-12-06 17:20:27,456 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (_ BitVec 1)) (v_ArrVal_1628 (_ BitVec 1)) (v_ArrVal_1625 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg v_ArrVal_1628))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1628) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1625) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) v_ArrVal_1629) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (_ bv0 1) (bvneg (bvneg v_ArrVal_1629)))))) is different from false [2021-12-06 17:20:27,529 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (_ BitVec 1)) (v_ArrVal_1628 (_ BitVec 1)) (v_ArrVal_1625 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg v_ArrVal_1628))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1628) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1625) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) v_ArrVal_1629) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (_ bv0 1) (bvneg (bvneg v_ArrVal_1629)))))) is different from false [2021-12-06 17:20:27,642 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (_ BitVec 1)) (v_ArrVal_1628 (_ BitVec 1)) (v_ArrVal_1625 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg v_ArrVal_1628))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1628) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1625) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) v_ArrVal_1629) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (_ bv0 1) (bvneg (bvneg v_ArrVal_1629)))))) is different from false [2021-12-06 17:20:27,702 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (_ BitVec 1)) (v_ArrVal_1628 (_ BitVec 1)) (v_ArrVal_1625 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1628) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_#res#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0) v_ArrVal_1625) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0)) v_ArrVal_1629) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (_ bv0 1) (bvneg v_ArrVal_1628))) (not (= (_ bv0 1) (bvneg (bvneg v_ArrVal_1629)))))) is different from false [2021-12-06 17:20:27,772 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (_ BitVec 1)) (v_ArrVal_1628 (_ BitVec 1)) (v_ArrVal_1625 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg v_ArrVal_1628))) (not (= (_ bv0 1) (bvneg (bvneg v_ArrVal_1629)))) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1628) (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) v_ArrVal_1625) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0)) v_ArrVal_1629) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2021-12-06 17:20:27,935 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (_ BitVec 1)) (v_ArrVal_1628 (_ BitVec 1)) (v_ArrVal_1625 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg v_ArrVal_1628))) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1628) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) v_ArrVal_1625) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)) v_ArrVal_1629) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (_ bv0 1) (bvneg (bvneg v_ArrVal_1629)))))) is different from false [2021-12-06 17:20:27,954 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:20:27,954 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 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-06 17:20:27,959 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 56 treesize of output 44 [2021-12-06 17:20:27,965 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 21 treesize of output 17