./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8db9818917d4101818df459d2d32c905a41e37ef ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8db9818917d4101818df459d2d32c905a41e37ef ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 03:01:26,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 03:01:26,097 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 03:01:26,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 03:01:26,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 03:01:26,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 03:01:26,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 03:01:26,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 03:01:26,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 03:01:26,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 03:01:26,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 03:01:26,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 03:01:26,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 03:01:26,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 03:01:26,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 03:01:26,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 03:01:26,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 03:01:26,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 03:01:26,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 03:01:26,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 03:01:26,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 03:01:26,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 03:01:26,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 03:01:26,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 03:01:26,240 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 03:01:26,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 03:01:26,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 03:01:26,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 03:01:26,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 03:01:26,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 03:01:26,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 03:01:26,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 03:01:26,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 03:01:26,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 03:01:26,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 03:01:26,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 03:01:26,255 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 03:01:26,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 03:01:26,256 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 03:01:26,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 03:01:26,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 03:01:26,261 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-11-30 03:01:26,320 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 03:01:26,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 03:01:26,322 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 03:01:26,322 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 03:01:26,323 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 03:01:26,323 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 03:01:26,323 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 03:01:26,323 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 03:01:26,324 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 03:01:26,324 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 03:01:26,325 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 03:01:26,326 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 03:01:26,326 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 03:01:26,326 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 03:01:26,327 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 03:01:26,327 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 03:01:26,328 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 03:01:26,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 03:01:26,328 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 03:01:26,329 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 03:01:26,329 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 03:01:26,329 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 03:01:26,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 03:01:26,330 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 03:01:26,330 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 03:01:26,330 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-30 03:01:26,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 03:01:26,333 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 03:01:26,333 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 03:01:26,333 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 03:01:26,334 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 03:01:26,334 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 03:01:26,334 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 03:01:26,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 03:01:26,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 03:01:26,335 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 03:01:26,335 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 03:01:26,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 03:01:26,336 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 03:01:26,336 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 03:01:26,337 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/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-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan 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 -> Taipan 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 -> 8db9818917d4101818df459d2d32c905a41e37ef [2020-11-30 03:01:26,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 03:01:26,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 03:01:26,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 03:01:26,720 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 03:01:26,723 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 03:01:26,724 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all.i [2020-11-30 03:01:26,807 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/data/7860cf5d2/42f764486b7c428db011b1d7c47f2b28/FLAG34e5aaff5 [2020-11-30 03:01:27,553 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 03:01:27,554 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/sv-benchmarks/c/list-simple/sll2n_update_all.i [2020-11-30 03:01:27,574 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/data/7860cf5d2/42f764486b7c428db011b1d7c47f2b28/FLAG34e5aaff5 [2020-11-30 03:01:27,841 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/data/7860cf5d2/42f764486b7c428db011b1d7c47f2b28 [2020-11-30 03:01:27,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 03:01:27,846 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 03:01:27,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 03:01:27,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 03:01:27,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 03:01:27,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:01:27" (1/1) ... [2020-11-30 03:01:27,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@602a9f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:27, skipping insertion in model container [2020-11-30 03:01:27,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:01:27" (1/1) ... [2020-11-30 03:01:27,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 03:01:27,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 03:01:28,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 03:01:28,399 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 03:01:28,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 03:01:28,576 INFO L208 MainTranslator]: Completed translation [2020-11-30 03:01:28,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:28 WrapperNode [2020-11-30 03:01:28,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 03:01:28,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 03:01:28,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 03:01:28,580 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 03:01:28,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:28" (1/1) ... [2020-11-30 03:01:28,638 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:28" (1/1) ... [2020-11-30 03:01:28,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 03:01:28,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 03:01:28,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 03:01:28,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 03:01:28,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:28" (1/1) ... [2020-11-30 03:01:28,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:28" (1/1) ... [2020-11-30 03:01:28,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:28" (1/1) ... [2020-11-30 03:01:28,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:28" (1/1) ... [2020-11-30 03:01:28,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:28" (1/1) ... [2020-11-30 03:01:28,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:28" (1/1) ... [2020-11-30 03:01:28,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:28" (1/1) ... [2020-11-30 03:01:28,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 03:01:28,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 03:01:28,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 03:01:28,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 03:01:28,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 03:01:28,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 03:01:28,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 03:01:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 03:01:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 03:01:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 03:01:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 03:01:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 03:01:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 03:01:28,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 03:01:28,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 03:01:30,064 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 03:01:30,065 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-11-30 03:01:30,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:01:30 BoogieIcfgContainer [2020-11-30 03:01:30,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 03:01:30,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 03:01:30,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 03:01:30,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 03:01:30,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:01:27" (1/3) ... [2020-11-30 03:01:30,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f28a06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:01:30, skipping insertion in model container [2020-11-30 03:01:30,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:28" (2/3) ... [2020-11-30 03:01:30,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f28a06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:01:30, skipping insertion in model container [2020-11-30 03:01:30,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:01:30" (3/3) ... [2020-11-30 03:01:30,079 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2020-11-30 03:01:30,092 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 03:01:30,098 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2020-11-30 03:01:30,113 INFO L253 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2020-11-30 03:01:30,138 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 03:01:30,139 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-30 03:01:30,139 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 03:01:30,139 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 03:01:30,139 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 03:01:30,140 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 03:01:30,140 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 03:01:30,140 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 03:01:30,158 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2020-11-30 03:01:30,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-11-30 03:01:30,166 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:01:30,167 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-11-30 03:01:30,167 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:01:30,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:01:30,175 INFO L82 PathProgramCache]: Analyzing trace with hash 5700206, now seen corresponding path program 1 times [2020-11-30 03:01:30,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:01:30,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495770224] [2020-11-30 03:01:30,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:01:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:01:30,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:01:30,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495770224] [2020-11-30 03:01:30,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:01:30,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 03:01:30,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220492800] [2020-11-30 03:01:30,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 03:01:30,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:01:30,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 03:01:30,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:01:30,421 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2020-11-30 03:01:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:01:30,629 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2020-11-30 03:01:30,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 03:01:30,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-11-30 03:01:30,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:01:30,645 INFO L225 Difference]: With dead ends: 78 [2020-11-30 03:01:30,645 INFO L226 Difference]: Without dead ends: 75 [2020-11-30 03:01:30,649 INFO L677 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 [2020-11-30 03:01:30,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-11-30 03:01:30,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 42. [2020-11-30 03:01:30,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-30 03:01:30,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2020-11-30 03:01:30,710 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 4 [2020-11-30 03:01:30,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:01:30,712 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2020-11-30 03:01:30,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 03:01:30,713 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-11-30 03:01:30,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-11-30 03:01:30,714 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:01:30,714 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-11-30 03:01:30,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 03:01:30,715 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:01:30,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:01:30,717 INFO L82 PathProgramCache]: Analyzing trace with hash 5700207, now seen corresponding path program 1 times [2020-11-30 03:01:30,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:01:30,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546767650] [2020-11-30 03:01:30,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:01:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:01:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:01:30,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546767650] [2020-11-30 03:01:30,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:01:30,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 03:01:30,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555431006] [2020-11-30 03:01:30,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 03:01:30,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:01:30,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 03:01:30,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:01:30,857 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2020-11-30 03:01:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:01:31,005 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2020-11-30 03:01:31,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 03:01:31,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-11-30 03:01:31,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:01:31,010 INFO L225 Difference]: With dead ends: 73 [2020-11-30 03:01:31,010 INFO L226 Difference]: Without dead ends: 73 [2020-11-30 03:01:31,011 INFO L677 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 [2020-11-30 03:01:31,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-30 03:01:31,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 40. [2020-11-30 03:01:31,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-30 03:01:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2020-11-30 03:01:31,024 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 4 [2020-11-30 03:01:31,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:01:31,025 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2020-11-30 03:01:31,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 03:01:31,025 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2020-11-30 03:01:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-30 03:01:31,026 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:01:31,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-30 03:01:31,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 03:01:31,031 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:01:31,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:01:31,034 INFO L82 PathProgramCache]: Analyzing trace with hash 181592322, now seen corresponding path program 1 times [2020-11-30 03:01:31,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:01:31,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851905849] [2020-11-30 03:01:31,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:01:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:01:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:01:31,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851905849] [2020-11-30 03:01:31,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:01:31,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 03:01:31,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564385865] [2020-11-30 03:01:31,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 03:01:31,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:01:31,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 03:01:31,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:01:31,098 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 3 states. [2020-11-30 03:01:31,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:01:31,127 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-11-30 03:01:31,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 03:01:31,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-30 03:01:31,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:01:31,131 INFO L225 Difference]: With dead ends: 47 [2020-11-30 03:01:31,131 INFO L226 Difference]: Without dead ends: 47 [2020-11-30 03:01:31,132 INFO L677 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 [2020-11-30 03:01:31,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-30 03:01:31,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2020-11-30 03:01:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-30 03:01:31,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2020-11-30 03:01:31,145 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 5 [2020-11-30 03:01:31,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:01:31,146 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2020-11-30 03:01:31,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 03:01:31,146 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2020-11-30 03:01:31,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-30 03:01:31,147 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:01:31,147 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-30 03:01:31,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 03:01:31,148 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:01:31,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:01:31,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1182934914, now seen corresponding path program 1 times [2020-11-30 03:01:31,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:01:31,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368639158] [2020-11-30 03:01:31,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:01:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:01:31,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:01:31,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368639158] [2020-11-30 03:01:31,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:01:31,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 03:01:31,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013928431] [2020-11-30 03:01:31,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 03:01:31,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:01:31,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 03:01:31,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:01:31,253 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 4 states. [2020-11-30 03:01:31,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:01:31,389 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2020-11-30 03:01:31,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 03:01:31,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-11-30 03:01:31,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:01:31,391 INFO L225 Difference]: With dead ends: 55 [2020-11-30 03:01:31,392 INFO L226 Difference]: Without dead ends: 55 [2020-11-30 03:01:31,392 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 03:01:31,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-11-30 03:01:31,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2020-11-30 03:01:31,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-30 03:01:31,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2020-11-30 03:01:31,405 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 6 [2020-11-30 03:01:31,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:01:31,405 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2020-11-30 03:01:31,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 03:01:31,407 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2020-11-30 03:01:31,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-30 03:01:31,407 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:01:31,408 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-30 03:01:31,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 03:01:31,410 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:01:31,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:01:31,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1182934915, now seen corresponding path program 1 times [2020-11-30 03:01:31,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:01:31,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531165679] [2020-11-30 03:01:31,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:01:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:01:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:01:31,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531165679] [2020-11-30 03:01:31,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:01:31,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 03:01:31,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883256159] [2020-11-30 03:01:31,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 03:01:31,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:01:31,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 03:01:31,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:01:31,504 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 4 states. [2020-11-30 03:01:31,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:01:31,607 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2020-11-30 03:01:31,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 03:01:31,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-11-30 03:01:31,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:01:31,609 INFO L225 Difference]: With dead ends: 42 [2020-11-30 03:01:31,609 INFO L226 Difference]: Without dead ends: 42 [2020-11-30 03:01:31,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 03:01:31,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-30 03:01:31,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2020-11-30 03:01:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-30 03:01:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2020-11-30 03:01:31,615 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 6 [2020-11-30 03:01:31,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:01:31,615 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2020-11-30 03:01:31,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 03:01:31,616 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-11-30 03:01:31,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 03:01:31,621 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:01:31,621 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:01:31,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 03:01:31,622 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:01:31,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:01:31,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1776297034, now seen corresponding path program 1 times [2020-11-30 03:01:31,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:01:31,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979137520] [2020-11-30 03:01:31,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:01:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:01:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:01:31,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979137520] [2020-11-30 03:01:31,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053502496] [2020-11-30 03:01:31,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:01:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:01:31,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 03:01:31,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:01:31,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:01:31,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:01:31,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:01:31,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [12362385] [2020-11-30 03:01:32,001 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-11-30 03:01:32,002 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 03:01:32,008 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 03:01:32,015 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 03:01:32,015 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 03:01:32,493 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:01:32,517 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:01:32,536 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:01:34,641 INFO L180 IcfgInterpreter]: Interpretation finished [2020-11-30 03:01:35,872 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 148 DAG size of output: 119 [2020-11-30 03:01:36,257 WARN L193 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2020-11-30 03:01:36,596 WARN L193 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2020-11-30 03:01:36,928 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2020-11-30 03:01:37,433 WARN L193 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2020-11-30 03:01:38,202 WARN L193 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 98 [2020-11-30 03:01:38,987 WARN L193 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 108 [2020-11-30 03:01:38,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:01:38,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [3, 3, 3] total 11 [2020-11-30 03:01:38,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188340023] [2020-11-30 03:01:38,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 03:01:38,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:01:38,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 03:01:38,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-11-30 03:01:38,991 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 9 states. [2020-11-30 03:01:39,213 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-30 03:01:39,549 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2020-11-30 03:01:40,278 WARN L193 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 118 [2020-11-30 03:01:40,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:01:40,466 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2020-11-30 03:01:40,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 03:01:40,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2020-11-30 03:01:40,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:01:40,493 INFO L225 Difference]: With dead ends: 42 [2020-11-30 03:01:40,493 INFO L226 Difference]: Without dead ends: 42 [2020-11-30 03:01:40,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2020-11-30 03:01:40,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-30 03:01:40,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-30 03:01:40,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-30 03:01:40,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2020-11-30 03:01:40,509 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 10 [2020-11-30 03:01:40,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:01:40,509 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2020-11-30 03:01:40,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 03:01:40,509 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-11-30 03:01:40,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-30 03:01:40,510 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:01:40,510 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:01:40,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-11-30 03:01:40,711 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:01:40,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:01:40,712 INFO L82 PathProgramCache]: Analyzing trace with hash -517943721, now seen corresponding path program 1 times [2020-11-30 03:01:40,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:01:40,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526625580] [2020-11-30 03:01:40,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:01:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:01:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 03:01:40,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526625580] [2020-11-30 03:01:40,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455344301] [2020-11-30 03:01:40,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:01:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:01:40,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 03:01:40,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:01:40,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 03:01:40,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:01:40,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 03:01:40,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [818109017] [2020-11-30 03:01:40,993 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2020-11-30 03:01:40,997 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 03:01:40,998 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 03:01:40,998 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 03:01:40,999 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 03:01:41,191 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:01:41,232 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:01:41,248 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:01:42,857 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:01:42,921 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:01:42,946 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:01:43,133 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:01:43,164 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:01:43,217 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:01:43,925 INFO L180 IcfgInterpreter]: Interpretation finished [2020-11-30 03:01:44,817 WARN L193 SmtUtils]: Spent 873.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 94 [2020-11-30 03:01:45,667 WARN L193 SmtUtils]: Spent 808.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 119 [2020-11-30 03:01:46,021 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2020-11-30 03:01:46,294 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2020-11-30 03:01:46,550 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2020-11-30 03:01:46,863 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2020-11-30 03:01:47,828 WARN L193 SmtUtils]: Spent 905.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 92 [2020-11-30 03:01:49,105 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 112 DAG size of output: 103 [2020-11-30 03:01:49,866 WARN L193 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 108 [2020-11-30 03:01:50,530 WARN L193 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 89 [2020-11-30 03:01:50,533 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-30 03:01:50,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:01:50,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2020-11-30 03:01:50,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025157546] [2020-11-30 03:01:50,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 03:01:50,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:01:50,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 03:01:50,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-11-30 03:01:50,535 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2020-11-30 03:01:50,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:01:50,556 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-11-30 03:01:50,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 03:01:50,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-30 03:01:50,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:01:50,561 INFO L225 Difference]: With dead ends: 47 [2020-11-30 03:01:50,561 INFO L226 Difference]: Without dead ends: 47 [2020-11-30 03:01:50,562 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-11-30 03:01:50,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-30 03:01:50,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-11-30 03:01:50,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-30 03:01:50,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2020-11-30 03:01:50,566 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 13 [2020-11-30 03:01:50,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:01:50,567 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2020-11-30 03:01:50,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 03:01:50,567 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2020-11-30 03:01:50,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 03:01:50,568 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:01:50,568 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-11-30 03:01:50,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:01:50,769 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:01:50,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:01:50,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2138720671, now seen corresponding path program 2 times [2020-11-30 03:01:50,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:01:50,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146972948] [2020-11-30 03:01:50,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:01:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:01:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 03:01:50,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146972948] [2020-11-30 03:01:50,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977299123] [2020-11-30 03:01:50,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:01:51,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-11-30 03:01:51,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 03:01:51,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-30 03:01:51,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:01:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 03:01:51,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:01:51,068 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 03:01:51,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1821098944] [2020-11-30 03:01:51,072 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2020-11-30 03:01:51,072 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 03:01:51,072 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 03:01:51,073 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 03:01:51,073 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 03:01:51,287 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:01:53,017 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:01:53,087 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:01:53,111 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:01:53,285 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:01:53,325 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:01:53,351 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:01:54,099 INFO L180 IcfgInterpreter]: Interpretation finished [2020-11-30 03:01:54,788 WARN L193 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 94 [2020-11-30 03:01:55,537 WARN L193 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 119 [2020-11-30 03:01:56,465 WARN L193 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 129 [2020-11-30 03:01:56,743 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-11-30 03:01:57,431 WARN L193 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2020-11-30 03:01:57,753 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2020-11-30 03:01:58,640 WARN L193 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 92 [2020-11-30 03:01:59,704 WARN L193 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 103 [2020-11-30 03:02:00,348 WARN L193 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 108 [2020-11-30 03:02:00,944 WARN L193 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 89 [2020-11-30 03:02:00,945 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-30 03:02:00,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:02:00,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 7 [2020-11-30 03:02:00,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302731880] [2020-11-30 03:02:00,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 03:02:00,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:00,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 03:02:00,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-11-30 03:02:00,947 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 8 states. [2020-11-30 03:02:01,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:01,345 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2020-11-30 03:02:01,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 03:02:01,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-11-30 03:02:01,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:01,347 INFO L225 Difference]: With dead ends: 101 [2020-11-30 03:02:01,347 INFO L226 Difference]: Without dead ends: 101 [2020-11-30 03:02:01,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2020-11-30 03:02:01,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-11-30 03:02:01,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 50. [2020-11-30 03:02:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-11-30 03:02:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2020-11-30 03:02:01,362 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 18 [2020-11-30 03:02:01,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:01,362 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2020-11-30 03:02:01,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 03:02:01,363 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2020-11-30 03:02:01,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 03:02:01,364 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:01,365 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-11-30 03:02:01,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable158 [2020-11-30 03:02:01,585 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:02:01,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:01,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2138720672, now seen corresponding path program 1 times [2020-11-30 03:02:01,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:01,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406899162] [2020-11-30 03:02:01,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:01,751 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 03:02:01,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406899162] [2020-11-30 03:02:01,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651535560] [2020-11-30 03:02:01,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:02:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:01,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 31 conjunts are in the unsatisfiable core [2020-11-30 03:02:01,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:02:01,937 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 03:02:01,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:02:02,006 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 03:02:02,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [490062190] [2020-11-30 03:02:02,009 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2020-11-30 03:02:02,009 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 03:02:02,010 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 03:02:02,010 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 03:02:02,010 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 03:02:02,199 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:02,214 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:02,227 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:03,227 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:03,246 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:03,261 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:03,421 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:03,476 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:03,496 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:03,990 INFO L180 IcfgInterpreter]: Interpretation finished [2020-11-30 03:02:04,743 WARN L193 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 95 [2020-11-30 03:02:05,460 WARN L193 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 119 [2020-11-30 03:02:05,673 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2020-11-30 03:02:05,872 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2020-11-30 03:02:06,128 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2020-11-30 03:02:06,462 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2020-11-30 03:02:07,553 WARN L193 SmtUtils]: Spent 983.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 94 [2020-11-30 03:02:08,919 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 112 DAG size of output: 103 [2020-11-30 03:02:09,700 WARN L193 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 108 [2020-11-30 03:02:10,331 WARN L193 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 89 [2020-11-30 03:02:10,332 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-30 03:02:10,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:02:10,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2020-11-30 03:02:10,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659837222] [2020-11-30 03:02:10,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 03:02:10,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:10,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 03:02:10,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2020-11-30 03:02:10,334 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand 14 states. [2020-11-30 03:02:10,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:10,593 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2020-11-30 03:02:10,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 03:02:10,598 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-11-30 03:02:10,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:10,599 INFO L225 Difference]: With dead ends: 75 [2020-11-30 03:02:10,599 INFO L226 Difference]: Without dead ends: 75 [2020-11-30 03:02:10,600 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2020-11-30 03:02:10,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-11-30 03:02:10,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 49. [2020-11-30 03:02:10,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-11-30 03:02:10,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2020-11-30 03:02:10,605 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 18 [2020-11-30 03:02:10,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:10,605 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2020-11-30 03:02:10,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 03:02:10,605 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-11-30 03:02:10,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-30 03:02:10,606 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:10,606 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:02:10,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable246 [2020-11-30 03:02:10,819 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:02:10,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:10,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1879520762, now seen corresponding path program 1 times [2020-11-30 03:02:10,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:10,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610624031] [2020-11-30 03:02:10,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-30 03:02:10,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610624031] [2020-11-30 03:02:10,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:02:10,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 03:02:10,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597071926] [2020-11-30 03:02:10,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 03:02:10,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:10,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 03:02:10,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:02:10,882 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 4 states. [2020-11-30 03:02:10,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:10,932 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2020-11-30 03:02:10,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 03:02:10,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-11-30 03:02:10,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:10,944 INFO L225 Difference]: With dead ends: 84 [2020-11-30 03:02:10,944 INFO L226 Difference]: Without dead ends: 84 [2020-11-30 03:02:10,945 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 03:02:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-30 03:02:10,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 51. [2020-11-30 03:02:10,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-30 03:02:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-30 03:02:10,950 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 19 [2020-11-30 03:02:10,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:10,950 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-30 03:02:10,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 03:02:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-30 03:02:10,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-30 03:02:10,951 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:10,952 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:02:10,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable339 [2020-11-30 03:02:10,952 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:02:10,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:10,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1879523311, now seen corresponding path program 1 times [2020-11-30 03:02:10,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:10,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615381455] [2020-11-30 03:02:10,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:11,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 03:02:11,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615381455] [2020-11-30 03:02:11,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:02:11,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 03:02:11,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683710432] [2020-11-30 03:02:11,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 03:02:11,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:11,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 03:02:11,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 03:02:11,048 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 5 states. [2020-11-30 03:02:11,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:11,234 INFO L93 Difference]: Finished difference Result 137 states and 150 transitions. [2020-11-30 03:02:11,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 03:02:11,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-11-30 03:02:11,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:11,236 INFO L225 Difference]: With dead ends: 137 [2020-11-30 03:02:11,236 INFO L226 Difference]: Without dead ends: 137 [2020-11-30 03:02:11,236 INFO L677 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 [2020-11-30 03:02:11,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-11-30 03:02:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 54. [2020-11-30 03:02:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-30 03:02:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2020-11-30 03:02:11,242 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 19 [2020-11-30 03:02:11,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:11,242 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2020-11-30 03:02:11,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 03:02:11,242 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2020-11-30 03:02:11,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-30 03:02:11,243 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:11,243 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:02:11,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable340 [2020-11-30 03:02:11,243 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:02:11,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:11,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1879523312, now seen corresponding path program 1 times [2020-11-30 03:02:11,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:11,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728410694] [2020-11-30 03:02:11,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 03:02:11,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728410694] [2020-11-30 03:02:11,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714528743] [2020-11-30 03:02:11,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:02:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:11,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 03:02:11,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:02:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 03:02:11,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:02:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 03:02:11,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [872934578] [2020-11-30 03:02:11,475 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2020-11-30 03:02:11,475 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 03:02:11,475 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 03:02:11,476 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 03:02:11,476 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 03:02:11,646 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:12,117 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:12,189 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:13,203 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:13,913 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:14,093 INFO L180 IcfgInterpreter]: Interpretation finished [2020-11-30 03:02:14,302 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2020-11-30 03:02:14,597 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2020-11-30 03:02:14,891 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2020-11-30 03:02:15,284 WARN L193 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2020-11-30 03:02:16,138 WARN L193 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2020-11-30 03:02:17,276 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 133 DAG size of output: 113 [2020-11-30 03:02:17,613 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2020-11-30 03:02:17,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:02:17,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 4, 4] total 16 [2020-11-30 03:02:17,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781698221] [2020-11-30 03:02:17,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 03:02:17,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:17,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 03:02:17,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2020-11-30 03:02:17,617 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 9 states. [2020-11-30 03:02:17,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:17,875 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2020-11-30 03:02:17,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 03:02:17,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-11-30 03:02:17,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:17,877 INFO L225 Difference]: With dead ends: 58 [2020-11-30 03:02:17,877 INFO L226 Difference]: Without dead ends: 58 [2020-11-30 03:02:17,877 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2020-11-30 03:02:17,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-11-30 03:02:17,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2020-11-30 03:02:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-30 03:02:17,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2020-11-30 03:02:17,884 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 19 [2020-11-30 03:02:17,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:17,885 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2020-11-30 03:02:17,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 03:02:17,885 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2020-11-30 03:02:17,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 03:02:17,886 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:17,886 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-11-30 03:02:18,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable341,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:02:18,097 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:02:18,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:18,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1978670169, now seen corresponding path program 1 times [2020-11-30 03:02:18,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:18,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448483055] [2020-11-30 03:02:18,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 03:02:18,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448483055] [2020-11-30 03:02:18,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325522799] [2020-11-30 03:02:18,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:02:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:18,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 03:02:18,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:02:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 03:02:18,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:02:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 03:02:18,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [654801492] [2020-11-30 03:02:18,360 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2020-11-30 03:02:18,363 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 03:02:18,364 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 03:02:18,364 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 03:02:18,364 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 03:02:18,538 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:18,561 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:18,576 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:19,606 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:19,648 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:19,665 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:19,818 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:19,849 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:19,901 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:20,202 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:20,493 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:20,746 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2020-11-30 03:02:20,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:02:20,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2020-11-30 03:02:20,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109785149] [2020-11-30 03:02:20,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 03:02:20,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:20,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 03:02:20,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-30 03:02:20,750 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 7 states. [2020-11-30 03:02:20,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:20,871 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2020-11-30 03:02:20,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 03:02:20,872 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-11-30 03:02:20,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:20,873 INFO L225 Difference]: With dead ends: 111 [2020-11-30 03:02:20,873 INFO L226 Difference]: Without dead ends: 111 [2020-11-30 03:02:20,873 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-11-30 03:02:20,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-11-30 03:02:20,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 62. [2020-11-30 03:02:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-30 03:02:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2020-11-30 03:02:20,878 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 20 [2020-11-30 03:02:20,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:20,878 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2020-11-30 03:02:20,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 03:02:20,878 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2020-11-30 03:02:20,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 03:02:20,879 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:20,879 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-11-30 03:02:21,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable411 [2020-11-30 03:02:21,080 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:02:21,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:21,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1978666597, now seen corresponding path program 1 times [2020-11-30 03:02:21,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:21,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717992860] [2020-11-30 03:02:21,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:02:21,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717992860] [2020-11-30 03:02:21,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32259915] [2020-11-30 03:02:21,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:02:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:21,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 53 conjunts are in the unsatisfiable core [2020-11-30 03:02:21,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:02:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:02:21,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:02:29,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:02:29,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1264920028] [2020-11-30 03:02:29,467 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2020-11-30 03:02:29,468 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 03:02:29,469 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 03:02:29,469 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 03:02:29,470 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 03:02:29,620 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:29,647 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:29,669 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:30,868 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:30,917 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:30,938 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:31,094 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:31,122 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:31,177 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:31,445 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:31,698 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:31,898 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2020-11-30 03:02:31,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:02:31,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 21 [2020-11-30 03:02:31,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232804922] [2020-11-30 03:02:31,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-30 03:02:31,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:31,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-30 03:02:31,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=394, Unknown=1, NotChecked=0, Total=462 [2020-11-30 03:02:31,900 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand 22 states. [2020-11-30 03:02:32,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:32,900 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2020-11-30 03:02:32,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 03:02:32,901 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 20 [2020-11-30 03:02:32,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:32,903 INFO L225 Difference]: With dead ends: 90 [2020-11-30 03:02:32,903 INFO L226 Difference]: Without dead ends: 90 [2020-11-30 03:02:32,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=235, Invalid=756, Unknown=1, NotChecked=0, Total=992 [2020-11-30 03:02:32,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-11-30 03:02:32,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2020-11-30 03:02:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-30 03:02:32,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2020-11-30 03:02:32,926 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 20 [2020-11-30 03:02:32,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:32,926 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2020-11-30 03:02:32,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-30 03:02:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2020-11-30 03:02:32,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 03:02:32,927 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:32,927 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-11-30 03:02:33,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable487 [2020-11-30 03:02:33,133 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:02:33,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:33,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1978666596, now seen corresponding path program 1 times [2020-11-30 03:02:33,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:33,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381952003] [2020-11-30 03:02:33,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:02:33,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381952003] [2020-11-30 03:02:33,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316187052] [2020-11-30 03:02:33,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:02:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:33,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 65 conjunts are in the unsatisfiable core [2020-11-30 03:02:33,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:02:34,407 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:02:34,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:02:35,637 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_5 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_50 Int) (v_DerPreprocessor_3 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_50) (let ((.cse0 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_50 v_DerPreprocessor_3) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_50 v_DerPreprocessor_5) .cse0)))))) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_50 Int) (v_DerPreprocessor_2 Int)) (or (<= 0 (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_50 v_DerPreprocessor_2) (+ c_ULTIMATE.start_main_~s~0.offset 4))) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_50)))) is different from false [2020-11-30 03:02:36,508 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_50 Int) (v_DerPreprocessor_2 Int)) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_50) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_50 v_DerPreprocessor_2) (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))))) (forall ((v_prenex_1 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_3 Int)) (or (let ((.cse0 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_1 v_DerPreprocessor_3) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_1 v_DerPreprocessor_5) .cse0)))) (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_1)))) is different from false [2020-11-30 03:02:37,129 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-11-30 03:02:37,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1318348574] [2020-11-30 03:02:37,133 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2020-11-30 03:02:37,133 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 03:02:37,133 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 03:02:37,134 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 03:02:37,134 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 03:02:37,304 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:37,318 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:37,331 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:38,403 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:38,457 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:38,479 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:38,678 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:38,701 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:38,721 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:38,989 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:39,248 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:39,457 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2020-11-30 03:02:39,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:02:39,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2020-11-30 03:02:39,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265340386] [2020-11-30 03:02:39,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-11-30 03:02:39,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:39,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-11-30 03:02:39,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=953, Unknown=2, NotChecked=126, Total=1190 [2020-11-30 03:02:39,459 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand 35 states. [2020-11-30 03:02:40,830 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base)) (.cse3 (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base)) (.cse5 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse4 (select .cse3 .cse5)) (.cse0 (select .cse1 .cse5))) (and (= c_ULTIMATE.start_sll_create_~head~0.offset 0) (= (select |c_#valid| c_ULTIMATE.start_sll_create_~new_head~0.base) 1) (= 8 (select |c_#length| c_ULTIMATE.start_sll_create_~new_head~0.base)) (not (= .cse0 c_ULTIMATE.start_sll_create_~head~0.base)) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_50 Int) (v_DerPreprocessor_2 Int)) (or (< c_ULTIMATE.start_sll_create_~head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_50) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_50 v_DerPreprocessor_2) (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))))) (= (select |c_#valid| c_ULTIMATE.start_sll_create_~head~0.base) 1) (= 8 (select |c_#length| (select .cse1 4))) (= (select |c_#length| c_ULTIMATE.start_sll_create_~head~0.base) 8) (= (select |c_#valid| c_ULTIMATE.start_node_create_~temp~0.base) 1) (= c_ULTIMATE.start_sll_create_~new_head~0.offset 0) (forall ((v_prenex_1 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_3 Int)) (or (let ((.cse2 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_1 v_DerPreprocessor_3) .cse2) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) v_prenex_1 v_DerPreprocessor_5) .cse2)))) (< c_ULTIMATE.start_sll_create_~head~0.offset v_prenex_1))) (= c_ULTIMATE.start_node_create_~temp~0.offset 0) (= (select .cse3 4) 0) (= 8 (select |c_#length| c_ULTIMATE.start_node_create_~temp~0.base)) (<= .cse4 0) (<= 0 .cse4) (<= (+ .cse4 8) (select |c_#length| .cse0))))) is different from false [2020-11-30 03:02:41,765 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base)) (.cse4 (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base)) (.cse5 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse3 (select .cse4 .cse5)) (.cse0 (select .cse1 .cse5))) (and (not (= c_ULTIMATE.start_main_~s~0.base .cse0)) (= (select |c_#length| (select .cse1 4)) 8) (forall ((v_DerPreprocessor_5 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_50 Int) (v_DerPreprocessor_3 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_50) (let ((.cse2 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_50 v_DerPreprocessor_3) .cse2) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_50 v_DerPreprocessor_5) .cse2)))))) (<= 0 .cse3) (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_50 Int) (v_DerPreprocessor_2 Int)) (or (<= 0 (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_50 v_DerPreprocessor_2) (+ c_ULTIMATE.start_main_~s~0.offset 4))) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_50))) (= c_ULTIMATE.start_main_~s~0.offset 0) (<= .cse3 0) (= (select .cse4 4) 0) (= (select |c_#length| c_ULTIMATE.start_main_~s~0.base) 8) (<= (+ .cse3 8) (select |c_#length| .cse0))))) is different from false [2020-11-30 03:02:43,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:43,219 INFO L93 Difference]: Finished difference Result 145 states and 175 transitions. [2020-11-30 03:02:43,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-30 03:02:43,220 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 20 [2020-11-30 03:02:43,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:43,222 INFO L225 Difference]: With dead ends: 145 [2020-11-30 03:02:43,222 INFO L226 Difference]: Without dead ends: 145 [2020-11-30 03:02:43,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=258, Invalid=1560, Unknown=4, NotChecked=340, Total=2162 [2020-11-30 03:02:43,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-11-30 03:02:43,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 71. [2020-11-30 03:02:43,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-30 03:02:43,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2020-11-30 03:02:43,228 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 20 [2020-11-30 03:02:43,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:43,235 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2020-11-30 03:02:43,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-11-30 03:02:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2020-11-30 03:02:43,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 03:02:43,239 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:43,239 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:02:43,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable563 [2020-11-30 03:02:43,440 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:02:43,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:43,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1015552789, now seen corresponding path program 1 times [2020-11-30 03:02:43,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:43,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428616689] [2020-11-30 03:02:43,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-30 03:02:43,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428616689] [2020-11-30 03:02:43,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:02:43,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 03:02:43,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792922451] [2020-11-30 03:02:43,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 03:02:43,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:43,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 03:02:43,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 03:02:43,577 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand 7 states. [2020-11-30 03:02:43,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:43,822 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2020-11-30 03:02:43,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 03:02:43,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-11-30 03:02:43,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:43,824 INFO L225 Difference]: With dead ends: 88 [2020-11-30 03:02:43,824 INFO L226 Difference]: Without dead ends: 88 [2020-11-30 03:02:43,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-11-30 03:02:43,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-11-30 03:02:43,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71. [2020-11-30 03:02:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-30 03:02:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2020-11-30 03:02:43,828 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 24 [2020-11-30 03:02:43,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:43,829 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2020-11-30 03:02:43,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 03:02:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2020-11-30 03:02:43,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 03:02:43,830 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:43,830 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:02:43,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable639 [2020-11-30 03:02:43,830 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:02:43,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:43,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1015644320, now seen corresponding path program 1 times [2020-11-30 03:02:43,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:43,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942597993] [2020-11-30 03:02:43,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-30 03:02:43,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942597993] [2020-11-30 03:02:43,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:02:43,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 03:02:43,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433287259] [2020-11-30 03:02:43,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 03:02:43,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:43,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 03:02:43,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:02:43,908 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand 4 states. [2020-11-30 03:02:43,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:43,941 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2020-11-30 03:02:43,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 03:02:43,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-11-30 03:02:43,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:43,943 INFO L225 Difference]: With dead ends: 76 [2020-11-30 03:02:43,943 INFO L226 Difference]: Without dead ends: 76 [2020-11-30 03:02:43,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:02:43,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-11-30 03:02:43,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2020-11-30 03:02:43,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-30 03:02:43,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2020-11-30 03:02:43,947 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 24 [2020-11-30 03:02:43,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:43,947 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2020-11-30 03:02:43,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 03:02:43,947 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2020-11-30 03:02:43,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 03:02:43,951 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:43,951 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2020-11-30 03:02:43,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable640 [2020-11-30 03:02:43,952 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:02:43,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:43,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1303014690, now seen corresponding path program 2 times [2020-11-30 03:02:43,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:43,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848119005] [2020-11-30 03:02:43,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-30 03:02:44,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848119005] [2020-11-30 03:02:44,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246583744] [2020-11-30 03:02:44,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:02:44,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-11-30 03:02:44,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 03:02:44,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 03:02:44,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:02:44,245 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-30 03:02:44,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:02:44,263 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-30 03:02:44,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1570148007] [2020-11-30 03:02:44,269 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2020-11-30 03:02:44,269 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 03:02:44,270 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 03:02:44,270 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 03:02:44,270 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 03:02:44,395 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:45,698 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:45,724 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:45,745 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:45,942 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:45,960 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:45,977 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:46,205 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:46,435 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:02:46,695 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2020-11-30 03:02:46,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:02:46,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2020-11-30 03:02:46,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42863793] [2020-11-30 03:02:46,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 03:02:46,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:02:46,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 03:02:46,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-11-30 03:02:46,697 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand 9 states. [2020-11-30 03:02:46,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:02:46,842 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2020-11-30 03:02:46,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 03:02:46,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-11-30 03:02:46,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:02:46,844 INFO L225 Difference]: With dead ends: 58 [2020-11-30 03:02:46,844 INFO L226 Difference]: Without dead ends: 56 [2020-11-30 03:02:46,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2020-11-30 03:02:46,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-11-30 03:02:46,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2020-11-30 03:02:46,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-30 03:02:46,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2020-11-30 03:02:46,847 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 25 [2020-11-30 03:02:46,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:02:46,847 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2020-11-30 03:02:46,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 03:02:46,847 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-11-30 03:02:46,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-30 03:02:46,848 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:02:46,848 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:02:47,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable641 [2020-11-30 03:02:47,061 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:02:47,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:02:47,061 INFO L82 PathProgramCache]: Analyzing trace with hash 585631501, now seen corresponding path program 1 times [2020-11-30 03:02:47,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:02:47,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058279654] [2020-11-30 03:02:47,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:02:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:47,560 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:02:47,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058279654] [2020-11-30 03:02:47,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220186088] [2020-11-30 03:02:47,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:02:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:02:47,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 84 conjunts are in the unsatisfiable core [2020-11-30 03:02:47,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:02:48,337 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:02:48,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:02:50,650 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-11-30 03:02:58,496 WARN L193 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 40 [2020-11-30 03:03:03,085 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2020-11-30 03:03:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:03:03,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [106744522] [2020-11-30 03:03:03,927 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-11-30 03:03:03,928 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 03:03:03,928 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 03:03:03,928 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 03:03:03,929 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 03:03:04,127 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:03:04,673 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:03:04,765 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:03:04,787 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:03:04,809 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:03:06,002 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:03:06,601 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2020-11-30 03:03:06,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:03:06,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 43 [2020-11-30 03:03:06,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788034240] [2020-11-30 03:03:06,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 43 states [2020-11-30 03:03:06,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:03:06,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2020-11-30 03:03:06,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1663, Unknown=6, NotChecked=0, Total=1806 [2020-11-30 03:03:06,603 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 43 states. [2020-11-30 03:03:07,962 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2020-11-30 03:03:09,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:03:09,552 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2020-11-30 03:03:09,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-30 03:03:09,554 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 27 [2020-11-30 03:03:09,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:03:09,555 INFO L225 Difference]: With dead ends: 93 [2020-11-30 03:03:09,555 INFO L226 Difference]: Without dead ends: 93 [2020-11-30 03:03:09,556 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=532, Invalid=3244, Unknown=6, NotChecked=0, Total=3782 [2020-11-30 03:03:09,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-11-30 03:03:09,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 53. [2020-11-30 03:03:09,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-30 03:03:09,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2020-11-30 03:03:09,559 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 27 [2020-11-30 03:03:09,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:03:09,560 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2020-11-30 03:03:09,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2020-11-30 03:03:09,560 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2020-11-30 03:03:09,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 03:03:09,560 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:03:09,561 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:03:09,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable715,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:03:09,777 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:03:09,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:03:09,777 INFO L82 PathProgramCache]: Analyzing trace with hash 974560525, now seen corresponding path program 1 times [2020-11-30 03:03:09,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:03:09,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401720562] [2020-11-30 03:03:09,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:03:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:03:09,872 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-30 03:03:09,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401720562] [2020-11-30 03:03:09,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:03:09,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 03:03:09,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291770890] [2020-11-30 03:03:09,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 03:03:09,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:03:09,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 03:03:09,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-30 03:03:09,874 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 8 states. [2020-11-30 03:03:10,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:03:10,046 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2020-11-30 03:03:10,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 03:03:10,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-11-30 03:03:10,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:03:10,048 INFO L225 Difference]: With dead ends: 62 [2020-11-30 03:03:10,048 INFO L226 Difference]: Without dead ends: 62 [2020-11-30 03:03:10,049 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-11-30 03:03:10,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-30 03:03:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2020-11-30 03:03:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-30 03:03:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2020-11-30 03:03:10,051 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 28 [2020-11-30 03:03:10,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:03:10,052 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2020-11-30 03:03:10,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 03:03:10,052 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-11-30 03:03:10,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 03:03:10,053 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:03:10,053 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:03:10,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable777 [2020-11-30 03:03:10,053 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:03:10,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:03:10,053 INFO L82 PathProgramCache]: Analyzing trace with hash 974558795, now seen corresponding path program 1 times [2020-11-30 03:03:10,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:03:10,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208478280] [2020-11-30 03:03:10,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:03:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:03:10,119 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-30 03:03:10,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208478280] [2020-11-30 03:03:10,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769451210] [2020-11-30 03:03:10,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:03:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:03:10,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 03:03:10,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:03:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-30 03:03:10,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:03:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-30 03:03:10,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [425219465] [2020-11-30 03:03:10,376 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-11-30 03:03:10,376 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 03:03:10,376 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 03:03:10,376 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 03:03:10,376 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 03:03:10,517 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:03:10,982 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:03:11,023 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:03:11,056 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:03:11,070 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:03:12,017 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:03:12,531 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2020-11-30 03:03:12,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:03:12,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2020-11-30 03:03:12,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903660417] [2020-11-30 03:03:12,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 03:03:12,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:03:12,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 03:03:12,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-11-30 03:03:12,533 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 10 states. [2020-11-30 03:03:12,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:03:12,792 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2020-11-30 03:03:12,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 03:03:12,793 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-11-30 03:03:12,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:03:12,794 INFO L225 Difference]: With dead ends: 60 [2020-11-30 03:03:12,794 INFO L226 Difference]: Without dead ends: 60 [2020-11-30 03:03:12,795 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2020-11-30 03:03:12,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-11-30 03:03:12,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2020-11-30 03:03:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-30 03:03:12,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2020-11-30 03:03:12,797 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 28 [2020-11-30 03:03:12,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:03:12,797 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2020-11-30 03:03:12,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 03:03:12,798 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-11-30 03:03:12,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-30 03:03:12,798 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:03:12,799 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:03:13,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable778 [2020-11-30 03:03:13,017 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:03:13,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:03:13,017 INFO L82 PathProgramCache]: Analyzing trace with hash 159447471, now seen corresponding path program 1 times [2020-11-30 03:03:13,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:03:13,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635572472] [2020-11-30 03:03:13,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:03:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:03:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-30 03:03:13,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635572472] [2020-11-30 03:03:13,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185007961] [2020-11-30 03:03:13,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:03:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:03:13,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 03:03:13,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:03:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-30 03:03:13,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:03:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-30 03:03:13,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1922343575] [2020-11-30 03:03:13,245 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2020-11-30 03:03:13,245 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 03:03:13,247 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 03:03:13,247 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 03:03:13,247 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 03:03:13,358 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:03:13,374 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:03:13,392 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:03:13,883 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:03:13,905 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:03:13,953 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:03:14,015 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:03:15,018 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:03:15,296 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:03:15,751 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2020-11-30 03:03:15,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:03:15,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2020-11-30 03:03:15,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783088981] [2020-11-30 03:03:15,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 03:03:15,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:03:15,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 03:03:15,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-30 03:03:15,753 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 7 states. [2020-11-30 03:03:15,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:03:15,830 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2020-11-30 03:03:15,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 03:03:15,834 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2020-11-30 03:03:15,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:03:15,834 INFO L225 Difference]: With dead ends: 51 [2020-11-30 03:03:15,834 INFO L226 Difference]: Without dead ends: 51 [2020-11-30 03:03:15,835 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-11-30 03:03:15,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-11-30 03:03:15,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-11-30 03:03:15,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-30 03:03:15,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2020-11-30 03:03:15,837 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 30 [2020-11-30 03:03:15,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:03:15,837 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2020-11-30 03:03:15,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 03:03:15,837 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-11-30 03:03:15,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-30 03:03:15,838 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:03:15,838 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:03:16,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable840 [2020-11-30 03:03:16,039 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:03:16,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:03:16,039 INFO L82 PathProgramCache]: Analyzing trace with hash 159450020, now seen corresponding path program 1 times [2020-11-30 03:03:16,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:03:16,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140376978] [2020-11-30 03:03:16,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:03:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:03:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:03:16,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140376978] [2020-11-30 03:03:16,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379174175] [2020-11-30 03:03:16,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:03:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:03:16,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 70 conjunts are in the unsatisfiable core [2020-11-30 03:03:16,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:03:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 03:03:17,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:03:18,472 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_8 Int) (ULTIMATE.start_sll_update_at_~head.offset Int)) (= c_ULTIMATE.start_sll_update_at_~head.base (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_8)) c_ULTIMATE.start_main_~s~0.base) (+ c_ULTIMATE.start_main_~s~0.offset 4)))) is different from false [2020-11-30 03:03:19,255 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_8 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_96 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) (+ c_ULTIMATE.start_sll_update_at_~head.offset 4)))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_96 v_DerPreprocessor_8)) c_ULTIMATE.start_main_~s~0.base) (+ c_ULTIMATE.start_main_~s~0.offset 4)) .cse0))) is different from false [2020-11-30 03:03:19,971 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_8 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_96 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_96 v_DerPreprocessor_8)) c_ULTIMATE.start_main_~s~0.base) .cse1))))) is different from false [2020-11-30 03:03:20,983 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_96 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) c_ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_9))) (.cse2 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse0 (select (select .cse1 c_ULTIMATE.start_main_~s~0.base) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 (store (select .cse1 .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_96 v_DerPreprocessor_8)) c_ULTIMATE.start_main_~s~0.base) .cse2))))) is different from false [2020-11-30 03:03:22,997 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_9 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_98 Int) (v_DerPreprocessor_8 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_96 Int)) (or (let ((.cse2 (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_98 v_DerPreprocessor_9)) (.cse3 (+ c_ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse0 (select .cse2 .cse3))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base .cse2))) (store .cse1 .cse0 (store (select .cse1 .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_96 v_DerPreprocessor_8))) c_ULTIMATE.start_main_~s~0.base) .cse3)))) (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_98))) is different from false [2020-11-30 03:03:25,035 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_9 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_98 Int) (v_DerPreprocessor_8 Int) (v_ULTIMATE.start_sll_update_at_~head.offset_96 Int)) (or (let ((.cse2 (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) v_ULTIMATE.start_sll_update_at_~head.offset_98 v_DerPreprocessor_9)) (.cse3 (+ c_ULTIMATE.start_sll_create_~head~0.offset 4))) (let ((.cse1 (select .cse2 .cse3))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base .cse2))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_ULTIMATE.start_sll_update_at_~head.offset_96 v_DerPreprocessor_8))) c_ULTIMATE.start_sll_create_~head~0.base) .cse3) .cse1))) (< c_ULTIMATE.start_sll_create_~head~0.offset v_ULTIMATE.start_sll_update_at_~head.offset_98))) is different from false [2020-11-30 03:03:25,044 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2020-11-30 03:03:25,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1781161648] [2020-11-30 03:03:25,047 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2020-11-30 03:03:25,047 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 03:03:25,047 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 03:03:25,047 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 03:03:25,048 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 03:03:25,071 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@1189862b at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:92) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:566) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:439) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:239) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:313) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:153) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2020-11-30 03:03:25,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-30 03:03:25,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-11-30 03:03:25,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409873958] [2020-11-30 03:03:25,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-30 03:03:25,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:03:25,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-30 03:03:25,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1043, Unknown=6, NotChecked=414, Total=1560 [2020-11-30 03:03:25,074 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 20 states. [2020-11-30 03:03:25,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-30 03:03:25,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable910 [2020-11-30 03:03:25,285 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@1189862b at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:356) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:204) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:61) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:63) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:97) 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:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) 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:1064) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:966) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:187) 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:743) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:674) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2020-11-30 03:03:25,287 INFO L168 Benchmark]: Toolchain (without parser) took 117440.76 ms. Allocated memory was 111.1 MB in the beginning and 283.1 MB in the end (delta: 172.0 MB). Free memory was 81.3 MB in the beginning and 226.5 MB in the end (delta: -145.2 MB). Peak memory consumption was 27.5 MB. Max. memory is 16.1 GB. [2020-11-30 03:03:25,287 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 79.7 MB. Free memory is still 37.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 03:03:25,288 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.85 ms. Allocated memory is still 111.1 MB. Free memory was 81.0 MB in the beginning and 75.3 MB in the end (delta: 5.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 03:03:25,288 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.28 ms. Allocated memory is still 111.1 MB. Free memory was 74.9 MB in the beginning and 73.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 03:03:25,288 INFO L168 Benchmark]: Boogie Preprocessor took 75.48 ms. Allocated memory is still 111.1 MB. Free memory was 72.8 MB in the beginning and 71.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 03:03:25,288 INFO L168 Benchmark]: RCFGBuilder took 1306.67 ms. Allocated memory is still 111.1 MB. Free memory was 71.1 MB in the beginning and 65.4 MB in the end (delta: 5.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 16.1 GB. [2020-11-30 03:03:25,288 INFO L168 Benchmark]: TraceAbstraction took 115216.74 ms. Allocated memory was 111.1 MB in the beginning and 283.1 MB in the end (delta: 172.0 MB). Free memory was 65.4 MB in the beginning and 226.5 MB in the end (delta: -161.2 MB). Peak memory consumption was 11.0 MB. Max. memory is 16.1 GB. [2020-11-30 03:03:25,289 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.34 ms. Allocated memory is still 79.7 MB. Free memory is still 37.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 728.85 ms. Allocated memory is still 111.1 MB. Free memory was 81.0 MB in the beginning and 75.3 MB in the end (delta: 5.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 104.28 ms. Allocated memory is still 111.1 MB. Free memory was 74.9 MB in the beginning and 73.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 75.48 ms. Allocated memory is still 111.1 MB. Free memory was 72.8 MB in the beginning and 71.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1306.67 ms. Allocated memory is still 111.1 MB. Free memory was 71.1 MB in the beginning and 65.4 MB in the end (delta: 5.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 115216.74 ms. Allocated memory was 111.1 MB in the beginning and 283.1 MB in the end (delta: 172.0 MB). Free memory was 65.4 MB in the beginning and 226.5 MB in the end (delta: -161.2 MB). Peak memory consumption was 11.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@1189862b de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@1189862b: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-11-30 03:03:28,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 03:03:28,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 03:03:28,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 03:03:28,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 03:03:28,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 03:03:28,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 03:03:28,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 03:03:28,433 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 03:03:28,441 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 03:03:28,443 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 03:03:28,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 03:03:28,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 03:03:28,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 03:03:28,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 03:03:28,472 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 03:03:28,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 03:03:28,478 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 03:03:28,483 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 03:03:28,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 03:03:28,495 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 03:03:28,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 03:03:28,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 03:03:28,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 03:03:28,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 03:03:28,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 03:03:28,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 03:03:28,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 03:03:28,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 03:03:28,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 03:03:28,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 03:03:28,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 03:03:28,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 03:03:28,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 03:03:28,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 03:03:28,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 03:03:28,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 03:03:28,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 03:03:28,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 03:03:28,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 03:03:28,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 03:03:28,540 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2020-11-30 03:03:28,592 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 03:03:28,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 03:03:28,595 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 03:03:28,596 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 03:03:28,596 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 03:03:28,597 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 03:03:28,597 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 03:03:28,598 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 03:03:28,598 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 03:03:28,600 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 03:03:28,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 03:03:28,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 03:03:28,602 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 03:03:28,602 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 03:03:28,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 03:03:28,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 03:03:28,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 03:03:28,604 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 03:03:28,604 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 03:03:28,604 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-30 03:03:28,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 03:03:28,605 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 03:03:28,605 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-30 03:03:28,606 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-30 03:03:28,606 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 03:03:28,607 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 03:03:28,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 03:03:28,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 03:03:28,608 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 03:03:28,608 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 03:03:28,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 03:03:28,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 03:03:28,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 03:03:28,610 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-11-30 03:03:28,610 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-30 03:03:28,611 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 03:03:28,611 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 03:03:28,612 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-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/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-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan 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 -> Taipan 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 -> 8db9818917d4101818df459d2d32c905a41e37ef [2020-11-30 03:03:29,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 03:03:29,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 03:03:29,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 03:03:29,144 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 03:03:29,144 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 03:03:29,146 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all.i [2020-11-30 03:03:29,233 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/data/8624c84a6/87f12def21b048aaa0b086a14c141b52/FLAG390335890 [2020-11-30 03:03:30,033 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 03:03:30,034 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/sv-benchmarks/c/list-simple/sll2n_update_all.i [2020-11-30 03:03:30,050 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/data/8624c84a6/87f12def21b048aaa0b086a14c141b52/FLAG390335890 [2020-11-30 03:03:30,298 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/data/8624c84a6/87f12def21b048aaa0b086a14c141b52 [2020-11-30 03:03:30,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 03:03:30,303 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 03:03:30,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 03:03:30,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 03:03:30,313 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 03:03:30,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:03:30" (1/1) ... [2020-11-30 03:03:30,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3639aaa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:30, skipping insertion in model container [2020-11-30 03:03:30,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:03:30" (1/1) ... [2020-11-30 03:03:30,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 03:03:30,374 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 03:03:30,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 03:03:30,932 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 03:03:31,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 03:03:31,143 INFO L208 MainTranslator]: Completed translation [2020-11-30 03:03:31,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:31 WrapperNode [2020-11-30 03:03:31,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 03:03:31,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 03:03:31,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 03:03:31,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 03:03:31,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:31" (1/1) ... [2020-11-30 03:03:31,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:31" (1/1) ... [2020-11-30 03:03:31,246 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 03:03:31,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 03:03:31,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 03:03:31,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 03:03:31,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:31" (1/1) ... [2020-11-30 03:03:31,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:31" (1/1) ... [2020-11-30 03:03:31,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:31" (1/1) ... [2020-11-30 03:03:31,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:31" (1/1) ... [2020-11-30 03:03:31,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:31" (1/1) ... [2020-11-30 03:03:31,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:31" (1/1) ... [2020-11-30 03:03:31,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:31" (1/1) ... [2020-11-30 03:03:31,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 03:03:31,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 03:03:31,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 03:03:31,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 03:03:31,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 03:03:31,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-11-30 03:03:31,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 03:03:31,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 03:03:31,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 03:03:31,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 03:03:31,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 03:03:31,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-11-30 03:03:31,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-30 03:03:31,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 03:03:31,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 03:03:32,354 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 03:03:32,359 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-11-30 03:03:32,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:03:32 BoogieIcfgContainer [2020-11-30 03:03:32,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 03:03:32,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 03:03:32,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 03:03:32,369 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 03:03:32,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:03:30" (1/3) ... [2020-11-30 03:03:32,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2efb8849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:03:32, skipping insertion in model container [2020-11-30 03:03:32,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:31" (2/3) ... [2020-11-30 03:03:32,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2efb8849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:03:32, skipping insertion in model container [2020-11-30 03:03:32,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:03:32" (3/3) ... [2020-11-30 03:03:32,373 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2020-11-30 03:03:32,388 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 03:03:32,397 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2020-11-30 03:03:32,413 INFO L253 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2020-11-30 03:03:32,454 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 03:03:32,456 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-30 03:03:32,456 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 03:03:32,456 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 03:03:32,457 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 03:03:32,457 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 03:03:32,457 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 03:03:32,457 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 03:03:32,479 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2020-11-30 03:03:32,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-30 03:03:32,491 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:03:32,492 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-30 03:03:32,492 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:03:32,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:03:32,501 INFO L82 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2020-11-30 03:03:32,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:03:32,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846394834] [2020-11-30 03:03:32,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-11-30 03:03:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:03:32,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 03:03:32,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:03:32,831 INFO L384 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 [2020-11-30 03:03:32,832 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:03:32,845 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:03:32,846 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:03:32,846 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 03:03:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:03:32,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:03:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:03:32,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846394834] [2020-11-30 03:03:32,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:03:32,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-11-30 03:03:32,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852671444] [2020-11-30 03:03:32,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 03:03:32,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:03:32,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 03:03:32,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:03:32,916 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2020-11-30 03:03:33,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:03:33,205 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2020-11-30 03:03:33,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 03:03:33,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-30 03:03:33,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:03:33,216 INFO L225 Difference]: With dead ends: 111 [2020-11-30 03:03:33,217 INFO L226 Difference]: Without dead ends: 106 [2020-11-30 03:03:33,218 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:03:33,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-11-30 03:03:33,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 60. [2020-11-30 03:03:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-11-30 03:03:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2020-11-30 03:03:33,260 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 5 [2020-11-30 03:03:33,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:03:33,261 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2020-11-30 03:03:33,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 03:03:33,261 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2020-11-30 03:03:33,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-30 03:03:33,262 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:03:33,262 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-30 03:03:33,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-30 03:03:33,471 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:03:33,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:03:33,472 INFO L82 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2020-11-30 03:03:33,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:03:33,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39572227] [2020-11-30 03:03:33,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-11-30 03:03:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:03:33,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 03:03:33,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:03:33,606 INFO L384 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 [2020-11-30 03:03:33,607 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:03:33,615 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:03:33,615 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:03:33,616 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 03:03:33,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:03:33,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:03:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:03:33,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39572227] [2020-11-30 03:03:33,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:03:33,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-11-30 03:03:33,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843845485] [2020-11-30 03:03:33,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 03:03:33,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:03:33,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 03:03:33,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:03:33,731 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 4 states. [2020-11-30 03:03:34,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:03:34,053 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2020-11-30 03:03:34,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 03:03:34,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-11-30 03:03:34,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:03:34,058 INFO L225 Difference]: With dead ends: 104 [2020-11-30 03:03:34,058 INFO L226 Difference]: Without dead ends: 104 [2020-11-30 03:03:34,060 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:03:34,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-30 03:03:34,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 58. [2020-11-30 03:03:34,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-11-30 03:03:34,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2020-11-30 03:03:34,071 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 5 [2020-11-30 03:03:34,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:03:34,071 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2020-11-30 03:03:34,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 03:03:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2020-11-30 03:03:34,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-30 03:03:34,072 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:03:34,073 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:03:34,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-30 03:03:34,285 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:03:34,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:03:34,286 INFO L82 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2020-11-30 03:03:34,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:03:34,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322015837] [2020-11-30 03:03:34,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-11-30 03:03:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:03:34,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 03:03:34,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:03:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:03:34,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:03:34,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:03:34,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322015837] [2020-11-30 03:03:34,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:03:34,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-11-30 03:03:34,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075426682] [2020-11-30 03:03:34,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 03:03:34,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:03:34,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 03:03:34,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:03:34,439 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 4 states. [2020-11-30 03:03:34,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:03:34,474 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2020-11-30 03:03:34,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 03:03:34,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-11-30 03:03:34,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:03:34,477 INFO L225 Difference]: With dead ends: 70 [2020-11-30 03:03:34,477 INFO L226 Difference]: Without dead ends: 70 [2020-11-30 03:03:34,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:03:34,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-30 03:03:34,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2020-11-30 03:03:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-11-30 03:03:34,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2020-11-30 03:03:34,487 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 8 [2020-11-30 03:03:34,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:03:34,488 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2020-11-30 03:03:34,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 03:03:34,488 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2020-11-30 03:03:34,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 03:03:34,489 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:03:34,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:03:34,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-30 03:03:34,708 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:03:34,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:03:34,709 INFO L82 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2020-11-30 03:03:34,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:03:34,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222742516] [2020-11-30 03:03:34,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-11-30 03:03:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:03:34,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 03:03:34,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:03:34,816 INFO L384 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 [2020-11-30 03:03:34,816 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:03:34,820 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:03:34,820 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:03:34,820 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 03:03:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:03:34,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:03:34,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:03:34,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222742516] [2020-11-30 03:03:34,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:03:34,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-11-30 03:03:34,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791477600] [2020-11-30 03:03:34,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 03:03:34,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:03:34,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 03:03:34,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 03:03:34,875 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 5 states. [2020-11-30 03:03:35,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:03:35,134 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2020-11-30 03:03:35,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 03:03:35,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-11-30 03:03:35,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:03:35,151 INFO L225 Difference]: With dead ends: 81 [2020-11-30 03:03:35,151 INFO L226 Difference]: Without dead ends: 81 [2020-11-30 03:03:35,152 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-30 03:03:35,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-11-30 03:03:35,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2020-11-30 03:03:35,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-30 03:03:35,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2020-11-30 03:03:35,162 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 9 [2020-11-30 03:03:35,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:03:35,163 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2020-11-30 03:03:35,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 03:03:35,163 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2020-11-30 03:03:35,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 03:03:35,164 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:03:35,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:03:35,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-30 03:03:35,376 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:03:35,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:03:35,377 INFO L82 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2020-11-30 03:03:35,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:03:35,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434688718] [2020-11-30 03:03:35,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-11-30 03:03:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:03:35,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 03:03:35,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:03:35,477 INFO L384 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 [2020-11-30 03:03:35,477 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:03:35,485 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:03:35,485 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:03:35,485 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 03:03:35,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:03:35,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:03:35,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:03:35,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434688718] [2020-11-30 03:03:35,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:03:35,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-11-30 03:03:35,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194713927] [2020-11-30 03:03:35,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 03:03:35,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:03:35,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 03:03:35,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-30 03:03:35,743 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 8 states. [2020-11-30 03:03:36,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:03:36,127 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2020-11-30 03:03:36,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 03:03:36,129 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2020-11-30 03:03:36,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:03:36,130 INFO L225 Difference]: With dead ends: 66 [2020-11-30 03:03:36,130 INFO L226 Difference]: Without dead ends: 66 [2020-11-30 03:03:36,131 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-11-30 03:03:36,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-11-30 03:03:36,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-11-30 03:03:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-30 03:03:36,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2020-11-30 03:03:36,137 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 9 [2020-11-30 03:03:36,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:03:36,137 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2020-11-30 03:03:36,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 03:03:36,138 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2020-11-30 03:03:36,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 03:03:36,138 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:03:36,139 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:03:36,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-11-30 03:03:36,340 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:03:36,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:03:36,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 1 times [2020-11-30 03:03:36,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:03:36,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394641473] [2020-11-30 03:03:36,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-11-30 03:03:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:03:36,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 03:03:36,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:03:36,523 INFO L384 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 [2020-11-30 03:03:36,523 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:03:36,526 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:03:36,527 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:03:36,527 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 03:03:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:03:36,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:03:36,656 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:03:36,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394641473] [2020-11-30 03:03:36,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:03:36,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2020-11-30 03:03:36,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608141623] [2020-11-30 03:03:36,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 03:03:36,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:03:36,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 03:03:36,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-30 03:03:36,659 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 9 states. [2020-11-30 03:03:37,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:03:37,549 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2020-11-30 03:03:37,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 03:03:37,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-11-30 03:03:37,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:03:37,551 INFO L225 Difference]: With dead ends: 119 [2020-11-30 03:03:37,551 INFO L226 Difference]: Without dead ends: 119 [2020-11-30 03:03:37,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-11-30 03:03:37,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-11-30 03:03:37,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 69. [2020-11-30 03:03:37,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-30 03:03:37,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2020-11-30 03:03:37,559 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 26 [2020-11-30 03:03:37,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:03:37,559 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2020-11-30 03:03:37,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 03:03:37,560 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2020-11-30 03:03:37,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 03:03:37,565 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:03:37,565 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:03:37,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-11-30 03:03:37,766 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:03:37,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:03:37,767 INFO L82 PathProgramCache]: Analyzing trace with hash 2130913171, now seen corresponding path program 1 times [2020-11-30 03:03:37,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:03:37,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842068756] [2020-11-30 03:03:37,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-11-30 03:03:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:03:37,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-30 03:03:37,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:03:37,935 INFO L384 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 [2020-11-30 03:03:37,935 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:03:37,943 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:03:37,943 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:03:37,943 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 03:03:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:03:38,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:03:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:03:38,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842068756] [2020-11-30 03:03:38,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:03:38,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2020-11-30 03:03:38,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142178588] [2020-11-30 03:03:38,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 03:03:38,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:03:38,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 03:03:38,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-11-30 03:03:38,698 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 16 states. [2020-11-30 03:03:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:03:40,161 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2020-11-30 03:03:40,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 03:03:40,162 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2020-11-30 03:03:40,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:03:40,163 INFO L225 Difference]: With dead ends: 139 [2020-11-30 03:03:40,163 INFO L226 Difference]: Without dead ends: 139 [2020-11-30 03:03:40,164 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2020-11-30 03:03:40,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-11-30 03:03:40,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 69. [2020-11-30 03:03:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-30 03:03:40,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2020-11-30 03:03:40,170 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 26 [2020-11-30 03:03:40,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:03:40,171 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2020-11-30 03:03:40,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 03:03:40,171 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2020-11-30 03:03:40,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 03:03:40,172 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:03:40,172 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:03:40,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-11-30 03:03:40,373 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:03:40,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:03:40,373 INFO L82 PathProgramCache]: Analyzing trace with hash -893106664, now seen corresponding path program 1 times [2020-11-30 03:03:40,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:03:40,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324215004] [2020-11-30 03:03:40,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-11-30 03:03:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:03:40,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 03:03:40,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:03:40,525 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 03:03:40,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:03:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 03:03:40,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324215004] [2020-11-30 03:03:40,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:03:40,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-30 03:03:40,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883305259] [2020-11-30 03:03:40,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 03:03:40,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:03:40,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 03:03:40,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-30 03:03:40,547 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2020-11-30 03:03:40,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:03:40,639 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2020-11-30 03:03:40,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 03:03:40,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-11-30 03:03:40,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:03:40,646 INFO L225 Difference]: With dead ends: 101 [2020-11-30 03:03:40,647 INFO L226 Difference]: Without dead ends: 101 [2020-11-30 03:03:40,647 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-11-30 03:03:40,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-11-30 03:03:40,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2020-11-30 03:03:40,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-11-30 03:03:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2020-11-30 03:03:40,664 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 28 [2020-11-30 03:03:40,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:03:40,664 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2020-11-30 03:03:40,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 03:03:40,665 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2020-11-30 03:03:40,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-30 03:03:40,667 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:03:40,668 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:03:40,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-11-30 03:03:40,883 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:03:40,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:03:40,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2020-11-30 03:03:40,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:03:40,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797239848] [2020-11-30 03:03:40,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-11-30 03:03:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:03:41,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 03:03:41,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:03:41,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 03:03:41,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:03:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 03:03:41,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797239848] [2020-11-30 03:03:41,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:03:41,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-30 03:03:41,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553407785] [2020-11-30 03:03:41,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 03:03:41,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:03:41,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 03:03:41,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 03:03:41,102 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand 6 states. [2020-11-30 03:03:41,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:03:41,175 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2020-11-30 03:03:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 03:03:41,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-11-30 03:03:41,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:03:41,176 INFO L225 Difference]: With dead ends: 92 [2020-11-30 03:03:41,177 INFO L226 Difference]: Without dead ends: 92 [2020-11-30 03:03:41,177 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-30 03:03:41,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-30 03:03:41,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2020-11-30 03:03:41,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-30 03:03:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2020-11-30 03:03:41,183 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 29 [2020-11-30 03:03:41,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:03:41,184 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2020-11-30 03:03:41,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 03:03:41,184 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2020-11-30 03:03:41,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 03:03:41,185 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:03:41,186 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:03:41,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-11-30 03:03:41,402 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:03:41,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:03:41,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1429900598, now seen corresponding path program 1 times [2020-11-30 03:03:41,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:03:41,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882263107] [2020-11-30 03:03:41,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-11-30 03:03:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:03:41,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 32 conjunts are in the unsatisfiable core [2020-11-30 03:03:41,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:03:41,640 INFO L384 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 [2020-11-30 03:03:41,640 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:03:41,642 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:03:41,643 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:03:41,643 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 03:03:41,704 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:03:41,704 INFO L384 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 39 [2020-11-30 03:03:41,705 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:03:41,736 INFO L625 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2020-11-30 03:03:41,741 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:03:41,741 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2020-11-30 03:03:41,870 INFO L384 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 [2020-11-30 03:03:41,871 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:03:41,883 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:03:41,886 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:03:41,887 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:30 [2020-11-30 03:03:42,246 INFO L384 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 17 [2020-11-30 03:03:42,247 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:03:42,262 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:03:42,263 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:03:42,263 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2020-11-30 03:03:42,356 INFO L384 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 [2020-11-30 03:03:42,357 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:03:42,376 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:03:42,377 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:03:42,378 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2020-11-30 03:03:42,526 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:03:42,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:03:42,750 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:03:42,758 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:03:42,758 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:03:42,759 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2020-11-30 03:03:45,367 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_node_create_#t~malloc5.base_11| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_node_create_#t~malloc5.base_11|))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_node_create_#t~malloc5.base_11| (_ bv1 1)) c_ULTIMATE.start_sll_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))) is different from false [2020-11-30 03:04:00,760 WARN L193 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 14 [2020-11-30 03:04:08,564 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2020-11-30 03:04:08,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882263107] [2020-11-30 03:04:08,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1874714917] [2020-11-30 03:04:08,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 03:04:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:04:08,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 33 conjunts are in the unsatisfiable core [2020-11-30 03:04:08,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:04:09,023 INFO L384 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 [2020-11-30 03:04:09,023 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:04:09,029 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:09,029 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:04:09,029 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 03:04:09,065 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:09,065 INFO L384 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 28 [2020-11-30 03:04:09,066 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:04:09,102 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2020-11-30 03:04:09,102 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:04:09,102 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2020-11-30 03:04:09,312 INFO L384 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 [2020-11-30 03:04:09,312 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:04:09,324 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:09,325 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:04:09,325 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2020-11-30 03:04:09,896 INFO L384 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 25 treesize of output 13 [2020-11-30 03:04:09,897 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:04:09,918 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:09,918 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:04:09,918 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2020-11-30 03:04:10,054 INFO L384 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 [2020-11-30 03:04:10,054 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:04:10,063 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:10,064 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:04:10,064 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2020-11-30 03:04:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:04:10,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:04:10,146 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:04:10,153 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:10,154 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:04:10,154 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2020-11-30 03:04:13,710 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:04:13,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420349062] [2020-11-30 03:04:13,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:04:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:04:13,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 30 conjunts are in the unsatisfiable core [2020-11-30 03:04:13,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:04:13,860 INFO L384 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 [2020-11-30 03:04:13,860 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:04:13,863 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:13,864 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:04:13,864 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 03:04:13,900 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:13,901 INFO L384 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 39 [2020-11-30 03:04:13,902 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:04:13,941 INFO L625 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2020-11-30 03:04:13,943 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:04:13,943 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2020-11-30 03:04:13,985 INFO L384 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 [2020-11-30 03:04:13,986 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:04:14,010 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:14,013 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:04:14,013 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:30 [2020-11-30 03:04:14,060 INFO L384 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 17 [2020-11-30 03:04:14,061 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:04:14,081 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:14,082 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:04:14,083 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2020-11-30 03:04:14,104 INFO L384 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 [2020-11-30 03:04:14,105 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:04:14,123 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:14,124 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:04:14,125 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2020-11-30 03:04:14,140 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:04:14,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:04:14,153 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:04:14,163 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:14,164 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:04:14,164 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2020-11-30 03:04:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:04:39,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-11-30 03:04:39,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16, 13, 16, 14] total 38 [2020-11-30 03:04:39,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397090023] [2020-11-30 03:04:39,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-11-30 03:04:39,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:04:39,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-11-30 03:04:39,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1273, Unknown=11, NotChecked=72, Total=1482 [2020-11-30 03:04:39,921 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand 39 states. [2020-11-30 03:04:42,613 WARN L193 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 28 DAG size of output: 18 [2020-11-30 03:04:46,013 WARN L193 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2020-11-30 03:04:46,396 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-11-30 03:04:46,692 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2020-11-30 03:04:47,155 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2020-11-30 03:04:47,703 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2020-11-30 03:04:48,017 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2020-11-30 03:04:52,901 WARN L193 SmtUtils]: Spent 4.33 s on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2020-11-30 03:04:53,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:04:53,447 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2020-11-30 03:04:53,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-30 03:04:53,447 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 33 [2020-11-30 03:04:53,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:04:53,450 INFO L225 Difference]: With dead ends: 165 [2020-11-30 03:04:53,451 INFO L226 Difference]: Without dead ends: 165 [2020-11-30 03:04:53,453 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 148 SyntacticMatches, 10 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 67.7s TimeCoverageRelationStatistics Valid=581, Invalid=2382, Unknown=11, NotChecked=106, Total=3080 [2020-11-30 03:04:53,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-11-30 03:04:53,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 93. [2020-11-30 03:04:53,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-11-30 03:04:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2020-11-30 03:04:53,461 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 33 [2020-11-30 03:04:53,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:04:53,462 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2020-11-30 03:04:53,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-11-30 03:04:53,462 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2020-11-30 03:04:53,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 03:04:53,463 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:04:53,463 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:04:54,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 mathsat -unsat_core_generation=3 [2020-11-30 03:04:54,069 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:04:54,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:04:54,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1429900597, now seen corresponding path program 1 times [2020-11-30 03:04:54,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:04:54,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586045050] [2020-11-30 03:04:54,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-11-30 03:04:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:04:54,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 40 conjunts are in the unsatisfiable core [2020-11-30 03:04:54,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:04:54,305 INFO L384 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 [2020-11-30 03:04:54,306 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:04:54,319 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:54,324 INFO L384 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 [2020-11-30 03:04:54,324 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:04:54,336 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:54,336 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:04:54,336 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-11-30 03:04:54,442 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:54,442 INFO L384 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 15 [2020-11-30 03:04:54,443 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:04:54,466 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:54,471 INFO L384 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 [2020-11-30 03:04:54,471 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:04:54,486 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:54,487 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:04:54,487 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2020-11-30 03:04:54,629 INFO L384 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 [2020-11-30 03:04:54,629 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:04:54,654 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:54,660 INFO L384 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 [2020-11-30 03:04:54,660 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:04:54,709 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:54,711 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:04:54,711 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:39 [2020-11-30 03:04:55,175 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-11-30 03:04:55,176 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:04:55,219 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:55,227 INFO L384 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 17 [2020-11-30 03:04:55,227 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:04:55,247 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:55,248 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:04:55,248 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:33 [2020-11-30 03:04:55,348 INFO L384 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 [2020-11-30 03:04:55,349 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:04:55,369 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:55,373 INFO L384 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 [2020-11-30 03:04:55,373 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:04:55,385 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:55,386 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:04:55,386 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2020-11-30 03:04:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:04:55,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:04:56,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:04:56,306 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:04:56,311 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:04:56,391 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:56,399 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:04:56,407 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:04:56,486 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:04:56,487 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-11-30 03:04:56,487 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:69 [2020-11-30 03:04:58,325 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:05:04,046 WARN L193 SmtUtils]: Spent 606.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2020-11-30 03:05:14,791 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-11-30 03:05:16,975 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-11-30 03:05:21,666 WARN L193 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-11-30 03:05:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:05:21,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586045050] [2020-11-30 03:05:21,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1263975813] [2020-11-30 03:05:21,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 03:05:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:05:22,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 43 conjunts are in the unsatisfiable core [2020-11-30 03:05:22,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:05:22,165 INFO L384 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 [2020-11-30 03:05:22,165 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:22,176 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:22,180 INFO L384 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 [2020-11-30 03:05:22,180 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:22,189 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:22,190 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:05:22,190 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-11-30 03:05:22,219 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:22,220 INFO L384 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 15 [2020-11-30 03:05:22,220 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:22,237 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:22,243 INFO L384 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 [2020-11-30 03:05:22,244 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:22,269 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:22,270 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:05:22,270 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2020-11-30 03:05:22,632 INFO L384 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 [2020-11-30 03:05:22,632 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:22,660 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:22,665 INFO L384 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 [2020-11-30 03:05:22,666 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:22,686 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:22,686 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:05:22,686 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:39 [2020-11-30 03:05:23,411 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-11-30 03:05:23,411 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:23,442 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:23,447 INFO L384 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 17 [2020-11-30 03:05:23,448 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:23,464 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:23,465 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:05:23,465 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:33 [2020-11-30 03:05:23,621 INFO L384 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 [2020-11-30 03:05:23,622 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:23,637 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:23,640 INFO L384 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 [2020-11-30 03:05:23,641 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:23,652 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:23,653 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:05:23,653 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:18 [2020-11-30 03:05:23,726 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:05:23,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:05:23,731 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:05:23,761 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:05:23,770 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:05:23,990 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-11-30 03:05:23,990 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:24,004 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:05:24,019 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:24,133 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-11-30 03:05:24,133 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:24,134 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-11-30 03:05:24,135 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:69 [2020-11-30 03:05:25,517 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:05:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:05:42,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179118867] [2020-11-30 03:05:42,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:05:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:05:43,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 40 conjunts are in the unsatisfiable core [2020-11-30 03:05:43,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:05:43,079 INFO L384 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 [2020-11-30 03:05:43,079 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:43,109 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:43,114 INFO L384 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 [2020-11-30 03:05:43,114 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:43,124 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:43,125 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:05:43,125 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-11-30 03:05:43,143 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:43,143 INFO L384 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 15 [2020-11-30 03:05:43,144 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:43,160 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:43,164 INFO L384 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 [2020-11-30 03:05:43,164 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:43,182 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:43,183 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:05:43,183 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2020-11-30 03:05:43,199 INFO L384 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 [2020-11-30 03:05:43,200 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:43,226 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:43,231 INFO L384 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 [2020-11-30 03:05:43,231 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:43,250 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:43,251 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:05:43,251 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:39 [2020-11-30 03:05:43,278 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-11-30 03:05:43,278 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:43,327 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:43,331 INFO L384 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 17 [2020-11-30 03:05:43,332 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:43,346 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:43,347 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:05:43,347 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:33 [2020-11-30 03:05:43,368 INFO L384 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 [2020-11-30 03:05:43,369 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:43,383 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:43,386 INFO L384 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 [2020-11-30 03:05:43,387 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:43,397 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:43,398 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:05:43,398 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2020-11-30 03:05:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:05:43,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:05:43,414 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:05:43,463 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:05:43,469 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:05:43,586 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-11-30 03:05:43,587 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:43,595 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:05:43,605 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:05:43,711 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-11-30 03:05:43,711 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:05:43,712 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-11-30 03:05:43,712 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:69 [2020-11-30 03:05:44,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:06:02,503 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 03:06:02,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-11-30 03:06:02,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16, 14, 16, 14] total 38 [2020-11-30 03:06:02,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050097000] [2020-11-30 03:06:02,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-11-30 03:06:02,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:06:02,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-11-30 03:06:02,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1344, Unknown=2, NotChecked=0, Total=1482 [2020-11-30 03:06:02,507 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand 39 states. [2020-11-30 03:06:04,749 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2020-11-30 03:06:05,485 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2020-11-30 03:06:05,905 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2020-11-30 03:06:06,292 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2020-11-30 03:06:07,034 WARN L193 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2020-11-30 03:06:07,377 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2020-11-30 03:06:07,848 WARN L193 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2020-11-30 03:06:08,287 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2020-11-30 03:06:08,729 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-11-30 03:06:09,104 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-11-30 03:06:09,891 WARN L193 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 100 [2020-11-30 03:06:10,597 WARN L193 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 96 [2020-11-30 03:06:11,915 WARN L193 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 102 [2020-11-30 03:06:12,272 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-11-30 03:06:21,387 WARN L193 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 110 DAG size of output: 94 [2020-11-30 03:06:25,375 WARN L193 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2020-11-30 03:06:40,432 WARN L193 SmtUtils]: Spent 4.91 s on a formula simplification. DAG size of input: 141 DAG size of output: 96 [2020-11-30 03:06:47,141 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 133 DAG size of output: 90 [2020-11-30 03:06:51,569 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2020-11-30 03:06:57,740 WARN L193 SmtUtils]: Spent 3.50 s on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2020-11-30 03:06:59,629 WARN L193 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 77 [2020-11-30 03:07:06,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:07:06,440 INFO L93 Difference]: Finished difference Result 292 states and 328 transitions. [2020-11-30 03:07:06,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-11-30 03:07:06,442 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 33 [2020-11-30 03:07:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:07:06,444 INFO L225 Difference]: With dead ends: 292 [2020-11-30 03:07:06,444 INFO L226 Difference]: Without dead ends: 292 [2020-11-30 03:07:06,447 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 142 SyntacticMatches, 13 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 104.7s TimeCoverageRelationStatistics Valid=879, Invalid=3671, Unknown=6, NotChecked=0, Total=4556 [2020-11-30 03:07:06,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2020-11-30 03:07:06,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 100. [2020-11-30 03:07:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-30 03:07:06,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2020-11-30 03:07:06,455 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 33 [2020-11-30 03:07:06,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:07:06,456 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2020-11-30 03:07:06,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-11-30 03:07:06,456 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2020-11-30 03:07:06,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-30 03:07:06,457 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:07:06,458 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:07:07,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 mathsat -unsat_core_generation=3,15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 03:07:07,077 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:07:07,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:07:07,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2001466816, now seen corresponding path program 1 times [2020-11-30 03:07:07,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:07:07,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705264022] [2020-11-30 03:07:07,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2020-11-30 03:07:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:07:07,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 03:07:07,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:07:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 03:07:07,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:07:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 03:07:07,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705264022] [2020-11-30 03:07:07,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1556101522] [2020-11-30 03:07:07,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 03:07:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:07:07,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 03:07:07,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:07:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 03:07:07,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:07:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 03:07:07,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978522912] [2020-11-30 03:07:07,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:07:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:07:07,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 03:07:07,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:07:07,658 INFO L384 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 [2020-11-30 03:07:07,658 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:07:07,660 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:07:07,660 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:07:07,660 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 03:07:07,763 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 03:07:07,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:07:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 03:07:07,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2020-11-30 03:07:07,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [5, 6, 5, 5] total 16 [2020-11-30 03:07:07,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780654827] [2020-11-30 03:07:07,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 03:07:07,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:07:07,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 03:07:07,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-11-30 03:07:07,804 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand 9 states. [2020-11-30 03:07:08,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:07:08,474 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2020-11-30 03:07:08,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 03:07:08,474 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2020-11-30 03:07:08,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:07:08,475 INFO L225 Difference]: With dead ends: 122 [2020-11-30 03:07:08,475 INFO L226 Difference]: Without dead ends: 122 [2020-11-30 03:07:08,475 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2020-11-30 03:07:08,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-30 03:07:08,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 106. [2020-11-30 03:07:08,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-30 03:07:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 132 transitions. [2020-11-30 03:07:08,480 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 132 transitions. Word has length 36 [2020-11-30 03:07:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:07:08,480 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 132 transitions. [2020-11-30 03:07:08,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 03:07:08,480 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 132 transitions. [2020-11-30 03:07:08,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-30 03:07:08,481 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:07:08,482 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:07:09,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 03:07:09,084 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:07:09,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:07:09,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2001466815, now seen corresponding path program 1 times [2020-11-30 03:07:09,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:07:09,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [638491504] [2020-11-30 03:07:09,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2020-11-30 03:07:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:07:09,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 03:07:09,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:07:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 03:07:09,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:07:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 03:07:09,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [638491504] [2020-11-30 03:07:09,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [254204027] [2020-11-30 03:07:09,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 03:07:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:07:09,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 03:07:09,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:07:09,553 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 03:07:09,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:07:09,556 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 03:07:09,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651739672] [2020-11-30 03:07:09,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:07:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:07:09,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-30 03:07:09,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:07:09,658 INFO L384 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 [2020-11-30 03:07:09,658 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:07:09,666 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:07:09,666 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:07:09,666 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 03:07:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 03:07:09,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:07:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 03:07:10,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2020-11-30 03:07:10,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [5, 5, 5, 5] total 22 [2020-11-30 03:07:10,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631282526] [2020-11-30 03:07:10,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 03:07:10,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:07:10,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 03:07:10,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2020-11-30 03:07:10,552 INFO L87 Difference]: Start difference. First operand 106 states and 132 transitions. Second operand 16 states. [2020-11-30 03:07:11,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:07:11,789 INFO L93 Difference]: Finished difference Result 137 states and 161 transitions. [2020-11-30 03:07:11,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 03:07:11,790 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2020-11-30 03:07:11,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:07:11,792 INFO L225 Difference]: With dead ends: 137 [2020-11-30 03:07:11,792 INFO L226 Difference]: Without dead ends: 137 [2020-11-30 03:07:11,792 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2020-11-30 03:07:11,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-11-30 03:07:11,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 106. [2020-11-30 03:07:11,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-30 03:07:11,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2020-11-30 03:07:11,796 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 36 [2020-11-30 03:07:11,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:07:11,796 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2020-11-30 03:07:11,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 03:07:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2020-11-30 03:07:11,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-30 03:07:11,798 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:07:11,798 INFO L422 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] [2020-11-30 03:07:12,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 03:07:12,399 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:07:12,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:07:12,399 INFO L82 PathProgramCache]: Analyzing trace with hash -681406170, now seen corresponding path program 2 times [2020-11-30 03:07:12,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:07:12,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022183593] [2020-11-30 03:07:12,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2020-11-30 03:07:12,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 03:07:12,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 03:07:12,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 03:07:12,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:07:12,606 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 03:07:12,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:07:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 03:07:12,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022183593] [2020-11-30 03:07:12,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [968239208] [2020-11-30 03:07:12,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 03:07:12,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 03:07:12,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 03:07:12,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 03:07:12,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:07:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 03:07:12,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:07:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 03:07:12,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178370278] [2020-11-30 03:07:12,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:07:13,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 03:07:13,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 03:07:13,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 03:07:13,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:07:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 03:07:13,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:07:13,513 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 03:07:13,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-11-30 03:07:13,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6, 6, 6, 9] total 18 [2020-11-30 03:07:13,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348944059] [2020-11-30 03:07:13,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-30 03:07:13,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:07:13,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-30 03:07:13,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2020-11-30 03:07:13,515 INFO L87 Difference]: Start difference. First operand 106 states and 128 transitions. Second operand 18 states. [2020-11-30 03:07:15,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:07:15,172 INFO L93 Difference]: Finished difference Result 395 states and 443 transitions. [2020-11-30 03:07:15,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-30 03:07:15,173 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2020-11-30 03:07:15,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:07:15,176 INFO L225 Difference]: With dead ends: 395 [2020-11-30 03:07:15,176 INFO L226 Difference]: Without dead ends: 395 [2020-11-30 03:07:15,177 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 193 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=224, Invalid=966, Unknown=0, NotChecked=0, Total=1190 [2020-11-30 03:07:15,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2020-11-30 03:07:15,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 132. [2020-11-30 03:07:15,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-11-30 03:07:15,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 168 transitions. [2020-11-30 03:07:15,192 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 168 transitions. Word has length 36 [2020-11-30 03:07:15,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:07:15,192 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 168 transitions. [2020-11-30 03:07:15,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-30 03:07:15,193 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 168 transitions. [2020-11-30 03:07:15,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-30 03:07:15,196 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:07:15,197 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-11-30 03:07:15,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3,24 cvc4 --incremental --print-success --lang smt --rewrite-divk,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:07:15,811 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:07:15,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:07:15,812 INFO L82 PathProgramCache]: Analyzing trace with hash -768960311, now seen corresponding path program 1 times [2020-11-30 03:07:15,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:07:15,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595227486] [2020-11-30 03:07:15,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2020-11-30 03:07:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:07:15,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 03:07:15,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:07:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-30 03:07:15,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:07:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-30 03:07:16,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595227486] [2020-11-30 03:07:16,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [488138076] [2020-11-30 03:07:16,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 03:07:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:07:16,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 03:07:16,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:07:16,400 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-30 03:07:16,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:07:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-30 03:07:16,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691440744] [2020-11-30 03:07:16,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:07:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:07:16,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 03:07:16,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:07:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-30 03:07:16,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:07:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-30 03:07:17,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-11-30 03:07:17,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6, 6, 7, 10] total 19 [2020-11-30 03:07:17,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576297104] [2020-11-30 03:07:17,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-30 03:07:17,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:07:17,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-30 03:07:17,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-11-30 03:07:17,216 INFO L87 Difference]: Start difference. First operand 132 states and 168 transitions. Second operand 19 states. [2020-11-30 03:07:17,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:07:17,474 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2020-11-30 03:07:17,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 03:07:17,475 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2020-11-30 03:07:17,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:07:17,476 INFO L225 Difference]: With dead ends: 92 [2020-11-30 03:07:17,476 INFO L226 Difference]: Without dead ends: 92 [2020-11-30 03:07:17,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 214 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2020-11-30 03:07:17,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-30 03:07:17,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2020-11-30 03:07:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-30 03:07:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2020-11-30 03:07:17,479 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 40 [2020-11-30 03:07:17,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:07:17,479 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2020-11-30 03:07:17,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-30 03:07:17,479 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2020-11-30 03:07:17,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-30 03:07:17,480 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:07:17,480 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 03:07:18,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 cvc4 --incremental --print-success --lang smt --rewrite-divk,26 mathsat -unsat_core_generation=3 [2020-11-30 03:07:18,089 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:07:18,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:07:18,089 INFO L82 PathProgramCache]: Analyzing trace with hash -803558610, now seen corresponding path program 1 times [2020-11-30 03:07:18,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:07:18,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801129885] [2020-11-30 03:07:18,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2020-11-30 03:07:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:07:18,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 03:07:18,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:07:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-11-30 03:07:18,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:07:18,311 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-11-30 03:07:18,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801129885] [2020-11-30 03:07:18,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:07:18,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-30 03:07:18,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264606552] [2020-11-30 03:07:18,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 03:07:18,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:07:18,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 03:07:18,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 03:07:18,313 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 6 states. [2020-11-30 03:07:18,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:07:18,363 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2020-11-30 03:07:18,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 03:07:18,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2020-11-30 03:07:18,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:07:18,364 INFO L225 Difference]: With dead ends: 83 [2020-11-30 03:07:18,364 INFO L226 Difference]: Without dead ends: 83 [2020-11-30 03:07:18,365 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 03:07:18,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-11-30 03:07:18,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2020-11-30 03:07:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-30 03:07:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2020-11-30 03:07:18,367 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 42 [2020-11-30 03:07:18,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:07:18,368 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2020-11-30 03:07:18,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 03:07:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2020-11-30 03:07:18,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-30 03:07:18,368 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:07:18,369 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 03:07:18,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2020-11-30 03:07:18,569 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:07:18,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:07:18,570 INFO L82 PathProgramCache]: Analyzing trace with hash -20302201, now seen corresponding path program 1 times [2020-11-30 03:07:18,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:07:18,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284039813] [2020-11-30 03:07:18,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2020-11-30 03:07:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:07:18,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 49 conjunts are in the unsatisfiable core [2020-11-30 03:07:18,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:07:18,767 INFO L384 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 [2020-11-30 03:07:18,768 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:07:18,770 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:07:18,770 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:07:18,770 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 03:07:18,831 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:07:18,832 INFO L384 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 15 [2020-11-30 03:07:18,832 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:07:18,840 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:07:18,840 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:07:18,840 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2020-11-30 03:07:18,925 INFO L384 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 [2020-11-30 03:07:18,926 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:07:18,937 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:07:18,937 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:07:18,937 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2020-11-30 03:07:19,137 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_113|], 2=[|v_#memory_$Pointer$.base_127|]} [2020-11-30 03:07:19,147 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 03:07:19,147 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:07:19,166 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:07:19,172 INFO L384 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 24 treesize of output 12 [2020-11-30 03:07:19,172 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:07:19,181 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:07:19,181 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:07:19,181 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:19 [2020-11-30 03:07:19,276 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:07:19,277 INFO L384 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 18 treesize of output 8 [2020-11-30 03:07:19,277 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:07:19,287 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:07:19,287 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:07:19,287 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:15 [2020-11-30 03:07:19,375 INFO L384 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 [2020-11-30 03:07:19,376 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:07:19,404 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:07:19,405 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:07:19,405 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2020-11-30 03:07:19,549 INFO L384 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 [2020-11-30 03:07:19,549 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:07:19,551 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:07:19,551 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:07:19,551 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-11-30 03:07:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:07:19,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:08:00,438 WARN L193 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 14 [2020-11-30 03:08:20,786 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2020-11-30 03:08:22,686 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_update_at_~head.offset_71 (_ BitVec 32)) (ULTIMATE.start_sll_update_at_~data (_ BitVec 32))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (bvadd c_ULTIMATE.start_main_~s~0.offset (_ bv4 32))))) (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_71 ULTIMATE.start_sll_update_at_~data))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset) c_ULTIMATE.start_main_~len~0)) is different from false [2020-11-30 03:08:22,715 INFO L384 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 194 treesize of output 186 [2020-11-30 03:08:22,715 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:08:22,716 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:08:22,719 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:08:23,005 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2020-11-30 03:08:23,006 INFO L625 ElimStorePlain]: treesize reduction 166, result has 25.9 percent of original size [2020-11-30 03:08:23,007 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:08:23,008 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-11-30 03:08:23,008 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:08:23,009 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-11-30 03:08:23,010 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:08:23,055 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:23,057 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2020-11-30 03:08:23,057 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:28 [2020-11-30 03:08:23,499 INFO L384 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 18 treesize of output 16 [2020-11-30 03:08:23,501 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-11-30 03:08:23,516 INFO L625 ElimStorePlain]: treesize reduction 18, result has 18.2 percent of original size [2020-11-30 03:08:23,516 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:08:23,519 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:23,519 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:08:23,519 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:4 [2020-11-30 03:08:23,701 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2020-11-30 03:08:23,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284039813] [2020-11-30 03:08:23,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1366584426] [2020-11-30 03:08:23,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 03:08:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:08:24,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 48 conjunts are in the unsatisfiable core [2020-11-30 03:08:24,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:08:24,086 INFO L384 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 [2020-11-30 03:08:24,086 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:08:24,091 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:24,091 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:08:24,091 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2020-11-30 03:08:24,332 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:24,332 INFO L384 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 15 [2020-11-30 03:08:24,332 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:08:24,339 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:24,339 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:08:24,339 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2020-11-30 03:08:24,544 INFO L384 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 [2020-11-30 03:08:24,544 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:08:24,554 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:24,554 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:08:24,554 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2020-11-30 03:08:24,963 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_123|], 2=[|v_#memory_$Pointer$.base_137|]} [2020-11-30 03:08:24,968 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 03:08:24,968 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:08:24,986 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:24,989 INFO L384 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 24 treesize of output 12 [2020-11-30 03:08:24,989 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:08:24,999 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:24,999 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:08:24,999 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:24 [2020-11-30 03:08:25,192 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:08:25,193 INFO L384 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 18 treesize of output 8 [2020-11-30 03:08:25,193 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:08:25,237 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:25,237 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:08:25,237 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:20 [2020-11-30 03:08:25,440 INFO L384 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 [2020-11-30 03:08:25,441 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:08:25,459 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:25,461 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:08:25,461 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:16 [2020-11-30 03:08:25,779 INFO L384 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 [2020-11-30 03:08:25,780 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:08:25,785 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:25,785 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:08:25,785 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2020-11-30 03:08:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:08:26,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:08:44,377 INFO L384 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 194 treesize of output 186 [2020-11-30 03:08:44,377 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:08:44,379 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:08:44,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:08:44,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:08:44,382 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:08:44,382 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:08:44,394 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-30 03:08:44,791 WARN L193 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2020-11-30 03:08:44,791 INFO L625 ElimStorePlain]: treesize reduction 291, result has 19.4 percent of original size [2020-11-30 03:08:44,794 INFO L545 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2020-11-30 03:08:44,876 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:44,878 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2020-11-30 03:08:44,878 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:56 [2020-11-30 03:08:45,083 INFO L384 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 18 treesize of output 16 [2020-11-30 03:08:45,086 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-11-30 03:08:45,097 INFO L625 ElimStorePlain]: treesize reduction 18, result has 18.2 percent of original size [2020-11-30 03:08:45,097 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:08:45,100 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:45,100 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:08:45,100 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:4 [2020-11-30 03:08:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2020-11-30 03:08:45,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902163287] [2020-11-30 03:08:45,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:08:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:08:45,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 48 conjunts are in the unsatisfiable core [2020-11-30 03:08:45,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:08:45,243 INFO L384 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 [2020-11-30 03:08:45,243 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:08:45,249 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:45,249 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:08:45,249 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2020-11-30 03:08:45,260 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:45,260 INFO L384 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 15 [2020-11-30 03:08:45,261 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:08:45,270 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:45,270 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:08:45,270 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2020-11-30 03:08:45,284 INFO L384 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 [2020-11-30 03:08:45,284 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:08:45,296 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:45,297 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:08:45,297 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2020-11-30 03:08:45,301 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_133|], 2=[|v_#memory_$Pointer$.base_147|]} [2020-11-30 03:08:45,307 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 03:08:45,308 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:08:45,332 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:45,337 INFO L384 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 24 treesize of output 12 [2020-11-30 03:08:45,337 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:08:45,350 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:45,350 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:08:45,350 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:24 [2020-11-30 03:08:45,356 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:08:45,357 INFO L384 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 18 treesize of output 8 [2020-11-30 03:08:45,358 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:08:45,377 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:45,378 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:08:45,378 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:20 [2020-11-30 03:08:45,387 INFO L384 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 [2020-11-30 03:08:45,387 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:08:45,404 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:45,412 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:08:45,412 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:16 [2020-11-30 03:08:45,418 INFO L384 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 [2020-11-30 03:08:45,418 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:08:45,423 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:45,424 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:08:45,424 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2020-11-30 03:08:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:08:45,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:08:47,470 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_sll_update_at_~data (_ BitVec 32)) (v_ULTIMATE.start_sll_update_at_~head.offset_79 (_ BitVec 32))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) (bvadd c_ULTIMATE.start_sll_update_at_~head.offset (_ bv4 32))))) (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_79 ULTIMATE.start_sll_update_at_~data))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset) c_ULTIMATE.start_main_~len~0)) is different from false [2020-11-30 03:08:49,479 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_sll_update_at_~data (_ BitVec 32)) (v_ULTIMATE.start_sll_update_at_~head.offset_79 (_ BitVec 32))) (= c_ULTIMATE.start_main_~len~0 (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (bvadd c_ULTIMATE.start_main_~s~0.offset (_ bv4 32))))) (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_79 ULTIMATE.start_sll_update_at_~data))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) is different from false [2020-11-30 03:08:49,487 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:08:49,502 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:49,507 INFO L384 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 126 treesize of output 122 [2020-11-30 03:08:49,508 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:08:49,637 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2020-11-30 03:08:49,637 INFO L625 ElimStorePlain]: treesize reduction 35, result has 62.4 percent of original size [2020-11-30 03:08:49,640 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2020-11-30 03:08:49,640 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:28 [2020-11-30 03:08:49,869 INFO L384 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 18 treesize of output 16 [2020-11-30 03:08:49,873 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-11-30 03:08:49,885 INFO L625 ElimStorePlain]: treesize reduction 18, result has 18.2 percent of original size [2020-11-30 03:08:49,885 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:08:49,887 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:08:49,887 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:08:49,887 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:4 [2020-11-30 03:08:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2020-11-30 03:08:49,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-11-30 03:08:49,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 25, 24, 25, 24] total 64 [2020-11-30 03:08:49,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253727071] [2020-11-30 03:08:49,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 64 states [2020-11-30 03:08:49,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:08:49,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2020-11-30 03:08:49,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=3417, Unknown=31, NotChecked=360, Total=4032 [2020-11-30 03:08:49,924 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 64 states. [2020-11-30 03:08:57,602 WARN L193 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2020-11-30 03:09:02,397 WARN L193 SmtUtils]: Spent 4.37 s on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2020-11-30 03:09:03,147 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2020-11-30 03:09:05,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:09:05,787 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2020-11-30 03:09:05,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-30 03:09:05,788 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 45 [2020-11-30 03:09:05,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:09:05,789 INFO L225 Difference]: With dead ends: 100 [2020-11-30 03:09:05,789 INFO L226 Difference]: Without dead ends: 100 [2020-11-30 03:09:05,792 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 191 SyntacticMatches, 11 SemanticMatches, 91 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1863 ImplicationChecksByTransitivity, 100.9s TimeCoverageRelationStatistics Valid=1007, Invalid=6984, Unknown=31, NotChecked=534, Total=8556 [2020-11-30 03:09:05,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-11-30 03:09:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2020-11-30 03:09:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-30 03:09:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2020-11-30 03:09:05,794 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 45 [2020-11-30 03:09:05,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:09:05,795 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2020-11-30 03:09:05,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2020-11-30 03:09:05,795 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2020-11-30 03:09:05,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-30 03:09:05,796 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:09:05,796 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 03:09:06,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 mathsat -unsat_core_generation=3,31 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 03:09:06,409 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-11-30 03:09:06,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:09:06,410 INFO L82 PathProgramCache]: Analyzing trace with hash -310561794, now seen corresponding path program 1 times [2020-11-30 03:09:06,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:09:06,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390579160] [2020-11-30 03:09:06,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2020-11-30 03:09:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:09:06,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 42 conjunts are in the unsatisfiable core [2020-11-30 03:09:06,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:09:06,688 INFO L384 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 [2020-11-30 03:09:06,688 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:09:06,691 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:09:06,691 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:09:06,691 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 03:09:06,725 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:09:06,726 INFO L384 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 15 [2020-11-30 03:09:06,726 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:09:06,743 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:09:06,744 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:09:06,744 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2020-11-30 03:09:06,804 INFO L384 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 [2020-11-30 03:09:06,804 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:09:06,815 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:09:06,815 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:09:06,816 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2020-11-30 03:09:07,057 INFO L384 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 24 treesize of output 12 [2020-11-30 03:09:07,058 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:09:07,067 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:09:07,067 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:09:07,068 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2020-11-30 03:09:07,246 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:09:07,380 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-11-30 03:09:07,380 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:09:07,381 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 105 [2020-11-30 03:09:07,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-11-30 03:09:07,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 03:09:07,385 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:09:07,438 INFO L625 ElimStorePlain]: treesize reduction 87, result has 19.4 percent of original size [2020-11-30 03:09:07,438 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:09:07,439 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:21 [2020-11-30 03:09:07,583 INFO L384 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 [2020-11-30 03:09:07,584 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:09:07,597 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:09:07,601 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:09:07,601 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2020-11-30 03:09:07,709 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-30 03:09:07,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:09:07,904 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:09:07,905 INFO L384 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 18 treesize of output 22 [2020-11-30 03:09:07,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:09:07,907 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:09:07,927 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:09:07,930 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:09:07,935 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:09:07,935 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 03:09:07,936 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:17 [2020-11-30 03:09:09,938 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (ULTIMATE.start_sll_update_at_~head.offset (_ BitVec 32))) (= c_ULTIMATE.start_sll_update_at_~head.base (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_update_at_~head.base) ULTIMATE.start_sll_update_at_~head.offset v_DerPreprocessor_19)) c_ULTIMATE.start_main_~s~0.base) (bvadd c_ULTIMATE.start_main_~s~0.offset (_ bv4 32))))) is different from false [2020-11-30 03:09:28,214 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_ULTIMATE.start_sll_update_at_~head.offset_83 (_ BitVec 32))) (let ((.cse1 (bvadd c_ULTIMATE.start_main_~s~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_83 v_DerPreprocessor_19)) c_ULTIMATE.start_main_~s~0.base) .cse1) .cse0)))) is different from false [2020-11-30 03:09:28,229 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:09:28,239 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:09:28,240 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-30 03:09:28,240 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:75 [2020-11-30 03:09:36,664 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_ULTIMATE.start_sll_update_at_~head.offset_83 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset v_DerPreprocessor_20)) (.cse3 (bvadd c_ULTIMATE.start_main_~s~0.offset (_ bv4 32)))) (let ((.cse0 (select .cse2 .cse3))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base .cse2))) (store .cse1 .cse0 (store (select .cse1 .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_83 v_DerPreprocessor_19))) c_ULTIMATE.start_main_~s~0.base) .cse3))))) is different from false [2020-11-30 03:09:38,673 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_ULTIMATE.start_sll_update_at_~head.offset_83 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res.base|) |c_ULTIMATE.start_sll_create_#res.offset| v_DerPreprocessor_20)) (.cse3 (bvadd |c_ULTIMATE.start_sll_create_#res.offset| (_ bv4 32)))) (let ((.cse1 (select .cse2 .cse3))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res.base| .cse2))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_ULTIMATE.start_sll_update_at_~head.offset_83 v_DerPreprocessor_19))) |c_ULTIMATE.start_sll_create_#res.base|) .cse3) .cse1)))) is different from false [2020-11-30 03:09:40,681 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_ULTIMATE.start_sll_update_at_~head.offset_83 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base) c_ULTIMATE.start_sll_create_~head~0.offset v_DerPreprocessor_20)) (.cse3 (bvadd c_ULTIMATE.start_sll_create_~head~0.offset (_ bv4 32)))) (let ((.cse0 (select .cse2 .cse3))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~head~0.base .cse2))) (store .cse1 .cse0 (store (select .cse1 .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_83 v_DerPreprocessor_19))) c_ULTIMATE.start_sll_create_~head~0.base) .cse3))))) is different from false [2020-11-30 03:09:42,691 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_ULTIMATE.start_sll_update_at_~head.offset_83 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~new_head~0.base) c_ULTIMATE.start_sll_create_~new_head~0.offset v_DerPreprocessor_20)) (.cse3 (bvadd c_ULTIMATE.start_sll_create_~new_head~0.offset (_ bv4 32)))) (let ((.cse0 (select .cse2 .cse3))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_create_~new_head~0.base .cse2))) (store .cse1 .cse0 (store (select .cse1 .cse0) v_ULTIMATE.start_sll_update_at_~head.offset_83 v_DerPreprocessor_19))) c_ULTIMATE.start_sll_create_~new_head~0.base) .cse3))))) is different from false [2020-11-30 03:09:42,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390579160] [2020-11-30 03:09:42,696 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2020-11-30 03:09:42,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1002234686] [2020-11-30 03:09:42,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 03:09:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:09:43,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 41 conjunts are in the unsatisfiable core [2020-11-30 03:09:43,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:09:43,182 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@5f66daa4 [2020-11-30 03:09:43,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310592547] [2020-11-30 03:09:43,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b3540d4-3829-48e9-a5cc-436a7849201e/bin/utaipan/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:09:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:09:43,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 40 conjunts are in the unsatisfiable core [2020-11-30 03:09:43,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:09:43,331 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@5f66daa4 [2020-11-30 03:09:43,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:09:43,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-11-30 03:09:43,331 ERROR L205 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2020-11-30 03:09:43,331 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 03:09:43,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 cvc4 --incremental --print-success --lang smt --rewrite-divk,33 mathsat -unsat_core_generation=3 [2020-11-30 03:09:43,954 WARN L238 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-11-30 03:09:43,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:09:43 BoogieIcfgContainer [2020-11-30 03:09:43,954 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 03:09:43,955 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 03:09:43,955 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 03:09:43,955 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 03:09:43,955 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:03:32" (3/4) ... [2020-11-30 03:09:43,958 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 03:09:43,959 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 03:09:43,960 INFO L168 Benchmark]: Toolchain (without parser) took 373657.31 ms. Allocated memory was 62.9 MB in the beginning and 130.0 MB in the end (delta: 67.1 MB). Free memory was 41.9 MB in the beginning and 51.8 MB in the end (delta: -9.9 MB). Peak memory consumption was 59.3 MB. Max. memory is 16.1 GB. [2020-11-30 03:09:43,961 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 62.9 MB. Free memory is still 44.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 03:09:43,961 INFO L168 Benchmark]: CACSL2BoogieTranslator took 840.21 ms. Allocated memory is still 62.9 MB. Free memory was 41.7 MB in the beginning and 34.0 MB in the end (delta: 7.8 MB). Peak memory consumption was 16.9 MB. Max. memory is 16.1 GB. [2020-11-30 03:09:43,961 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.31 ms. Allocated memory is still 62.9 MB. Free memory was 34.0 MB in the beginning and 31.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 03:09:43,962 INFO L168 Benchmark]: Boogie Preprocessor took 87.79 ms. Allocated memory is still 62.9 MB. Free memory was 31.6 MB in the beginning and 29.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 03:09:43,962 INFO L168 Benchmark]: RCFGBuilder took 1026.16 ms. Allocated memory was 62.9 MB in the beginning and 88.1 MB in the end (delta: 25.2 MB). Free memory was 29.8 MB in the beginning and 48.6 MB in the end (delta: -18.8 MB). Peak memory consumption was 11.1 MB. Max. memory is 16.1 GB. [2020-11-30 03:09:43,963 INFO L168 Benchmark]: TraceAbstraction took 371589.89 ms. Allocated memory was 88.1 MB in the beginning and 130.0 MB in the end (delta: 41.9 MB). Free memory was 48.2 MB in the beginning and 52.4 MB in the end (delta: -4.2 MB). Peak memory consumption was 37.5 MB. Max. memory is 16.1 GB. [2020-11-30 03:09:43,963 INFO L168 Benchmark]: Witness Printer took 4.01 ms. Allocated memory is still 130.0 MB. Free memory is still 51.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 03:09:43,966 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.28 ms. Allocated memory is still 62.9 MB. Free memory is still 44.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 840.21 ms. Allocated memory is still 62.9 MB. Free memory was 41.7 MB in the beginning and 34.0 MB in the end (delta: 7.8 MB). Peak memory consumption was 16.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 100.31 ms. Allocated memory is still 62.9 MB. Free memory was 34.0 MB in the beginning and 31.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 87.79 ms. Allocated memory is still 62.9 MB. Free memory was 31.6 MB in the beginning and 29.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1026.16 ms. Allocated memory was 62.9 MB in the beginning and 88.1 MB in the end (delta: 25.2 MB). Free memory was 29.8 MB in the beginning and 48.6 MB in the end (delta: -18.8 MB). Peak memory consumption was 11.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 371589.89 ms. Allocated memory was 88.1 MB in the beginning and 130.0 MB in the end (delta: 41.9 MB). Free memory was 48.2 MB in the beginning and 52.4 MB in the end (delta: -4.2 MB). Peak memory consumption was 37.5 MB. Max. memory is 16.1 GB. * Witness Printer took 4.01 ms. Allocated memory is still 130.0 MB. Free memory is still 51.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 604]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L614] const int len = 2; [L615] const int data = 1; [L584] SLL head = ((void *)0); [L585] COND TRUE len > 0 [L575] SLL temp = (SLL) malloc(sizeof(struct node)); [L576] COND FALSE !(((void *)0) == temp) [L579] temp->next = ((void *)0) [L580] temp->data = data [L581] return temp; [L586] SLL new_head = node_create(data); [L587] new_head->next = head [L588] head = new_head [L585] len-- [L585] COND TRUE len > 0 [L575] SLL temp = (SLL) malloc(sizeof(struct node)); [L576] COND FALSE !(((void *)0) == temp) [L579] temp->next = ((void *)0) [L580] temp->data = data [L581] return temp; [L586] SLL new_head = node_create(data); [L587] new_head->next = head [L588] head = new_head [L585] len-- [L585] COND FALSE !(len > 0) [L590] return head; [L616] SLL s = sll_create(len, data); [L617] int i; [L618] i = 0 [L618] COND TRUE i < len [L619] int new_data = i + len; [L607] COND FALSE !(index > 0) [L611] head->data = data [L618] i++ [L618] COND TRUE i < len [L619] int new_data = i + len; [L607] COND TRUE index > 0 [L608] EXPR head->next [L608] head = head->next [L609] index-- [L607] COND FALSE !(index > 0) [L611] head->data = data [L618] i++ [L618] COND FALSE !(i < len) [L622] i = 0 [L622] COND TRUE i < len [L623] int expected = i + len; [L600] COND FALSE !(index > 0) [L604] EXPR head->data [L604] return head->data; [L624] COND FALSE !(expected != sll_get_data_at(s, i)) [L622] i++ [L622] COND TRUE i < len [L623] int expected = i + len; [L600] COND TRUE index > 0 [L601] EXPR head->next [L601] head = head->next [L602] index-- [L600] COND FALSE !(index > 0) [L604] head->data - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 21 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 371.4s, OverallIterations: 18, TraceHistogramMax: 3, AutomataDifference: 101.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 956 SDtfs, 9685 SDslu, 3753 SDs, 0 SdLazy, 4118 SolverSat, 594 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 33.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2009 GetRequests, 1579 SyntacticMatches, 45 SemanticMatches, 385 ConstructedPredicates, 4 IntricatePredicates, 5 DeprecatedPredicates, 4219 ImplicationChecksByTransitivity, 280.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 855 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 220.7s InterpolantComputationTime, 964 NumberOfCodeBlocks, 964 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1866 ConstructedInterpolants, 194 QuantifiedInterpolants, 516824 SizeOfPredicates, 451 NumberOfNonLiveVariables, 4426 ConjunctsInSsa, 520 ConjunctsInUnsatCore, 62 InterpolantComputations, 24 PerfectInterpolantSequences, 614/946 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...