./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0232-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/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 aeec7a18a8140b87b664dd42e07dd87d1c028ac9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/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 aeec7a18a8140b87b664dd42e07dd87d1c028ac9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 19:05:55,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 19:05:55,255 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 19:05:55,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 19:05:55,296 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 19:05:55,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 19:05:55,298 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 19:05:55,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 19:05:55,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 19:05:55,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 19:05:55,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 19:05:55,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 19:05:55,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 19:05:55,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 19:05:55,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 19:05:55,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 19:05:55,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 19:05:55,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 19:05:55,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 19:05:55,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 19:05:55,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 19:05:55,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 19:05:55,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 19:05:55,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 19:05:55,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 19:05:55,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 19:05:55,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 19:05:55,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 19:05:55,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 19:05:55,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 19:05:55,325 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 19:05:55,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 19:05:55,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 19:05:55,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 19:05:55,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 19:05:55,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 19:05:55,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 19:05:55,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 19:05:55,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 19:05:55,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 19:05:55,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 19:05:55,331 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-12-09 19:05:55,354 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 19:05:55,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 19:05:55,355 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 19:05:55,356 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 19:05:55,356 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 19:05:55,356 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 19:05:55,356 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 19:05:55,356 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 19:05:55,357 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 19:05:55,357 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 19:05:55,357 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 19:05:55,357 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 19:05:55,357 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 19:05:55,358 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 19:05:55,358 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 19:05:55,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 19:05:55,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 19:05:55,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 19:05:55,359 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 19:05:55,359 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 19:05:55,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 19:05:55,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 19:05:55,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 19:05:55,360 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 19:05:55,360 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 19:05:55,360 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 19:05:55,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 19:05:55,361 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 19:05:55,361 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 19:05:55,361 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 19:05:55,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 19:05:55,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 19:05:55,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 19:05:55,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 19:05:55,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 19:05:55,362 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 19:05:55,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 19:05:55,363 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 19:05:55,363 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 19:05:55,363 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_c918000f-8927-46b5-963f-4d905575f8d5/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_c918000f-8927-46b5-963f-4d905575f8d5/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 -> aeec7a18a8140b87b664dd42e07dd87d1c028ac9 [2020-12-09 19:05:55,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 19:05:55,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 19:05:55,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 19:05:55,549 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 19:05:55,550 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 19:05:55,550 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/../../sv-benchmarks/c/memsafety/test-0232-1.i [2020-12-09 19:05:55,589 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/data/387d40a81/672dcd8ea16045079a189f06e0bec9b0/FLAG6e7793710 [2020-12-09 19:05:56,016 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 19:05:56,016 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/sv-benchmarks/c/memsafety/test-0232-1.i [2020-12-09 19:05:56,025 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/data/387d40a81/672dcd8ea16045079a189f06e0bec9b0/FLAG6e7793710 [2020-12-09 19:05:56,036 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/data/387d40a81/672dcd8ea16045079a189f06e0bec9b0 [2020-12-09 19:05:56,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 19:05:56,040 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 19:05:56,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 19:05:56,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 19:05:56,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 19:05:56,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:05:56" (1/1) ... [2020-12-09 19:05:56,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a48f8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:56, skipping insertion in model container [2020-12-09 19:05:56,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:05:56" (1/1) ... [2020-12-09 19:05:56,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 19:05:56,079 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 19:05:56,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:05:56,295 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 19:05:56,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:05:56,359 INFO L208 MainTranslator]: Completed translation [2020-12-09 19:05:56,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:56 WrapperNode [2020-12-09 19:05:56,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 19:05:56,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 19:05:56,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 19:05:56,360 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 19:05:56,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:56" (1/1) ... [2020-12-09 19:05:56,379 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:56" (1/1) ... [2020-12-09 19:05:56,398 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 19:05:56,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 19:05:56,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 19:05:56,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 19:05:56,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:56" (1/1) ... [2020-12-09 19:05:56,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:56" (1/1) ... [2020-12-09 19:05:56,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:56" (1/1) ... [2020-12-09 19:05:56,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:56" (1/1) ... [2020-12-09 19:05:56,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:56" (1/1) ... [2020-12-09 19:05:56,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:56" (1/1) ... [2020-12-09 19:05:56,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:56" (1/1) ... [2020-12-09 19:05:56,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 19:05:56,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 19:05:56,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 19:05:56,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 19:05:56,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/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-12-09 19:05:56,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 19:05:56,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-09 19:05:56,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 19:05:56,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 19:05:56,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 19:05:56,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-09 19:05:56,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 19:05:56,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 19:05:56,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 19:05:56,852 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 19:05:56,853 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2020-12-09 19:05:56,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:05:56 BoogieIcfgContainer [2020-12-09 19:05:56,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 19:05:56,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 19:05:56,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 19:05:56,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 19:05:56,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:05:56" (1/3) ... [2020-12-09 19:05:56,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366dffd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:05:56, skipping insertion in model container [2020-12-09 19:05:56,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:05:56" (2/3) ... [2020-12-09 19:05:56,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366dffd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:05:56, skipping insertion in model container [2020-12-09 19:05:56,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:05:56" (3/3) ... [2020-12-09 19:05:56,862 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232-1.i [2020-12-09 19:05:56,874 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 19:05:56,877 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2020-12-09 19:05:56,884 INFO L253 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2020-12-09 19:05:56,898 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 19:05:56,898 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 19:05:56,898 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 19:05:56,898 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 19:05:56,899 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 19:05:56,899 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 19:05:56,899 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 19:05:56,899 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 19:05:56,914 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2020-12-09 19:05:56,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 19:05:56,919 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:05:56,920 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 19:05:56,920 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:05:56,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:05:56,926 INFO L82 PathProgramCache]: Analyzing trace with hash 139539, now seen corresponding path program 1 times [2020-12-09 19:05:56,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:05:56,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896061561] [2020-12-09 19:05:56,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:05:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:05:57,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:05:57,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896061561] [2020-12-09 19:05:57,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:05:57,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 19:05:57,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700443277] [2020-12-09 19:05:57,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:05:57,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:05:57,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:05:57,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:05:57,102 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 4 states. [2020-12-09 19:05:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:05:57,256 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2020-12-09 19:05:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 19:05:57,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2020-12-09 19:05:57,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:05:57,263 INFO L225 Difference]: With dead ends: 83 [2020-12-09 19:05:57,263 INFO L226 Difference]: Without dead ends: 82 [2020-12-09 19:05:57,264 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-12-09 19:05:57,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-12-09 19:05:57,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 64. [2020-12-09 19:05:57,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-09 19:05:57,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2020-12-09 19:05:57,289 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 3 [2020-12-09 19:05:57,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:05:57,290 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2020-12-09 19:05:57,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:05:57,290 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2020-12-09 19:05:57,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 19:05:57,290 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:05:57,290 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 19:05:57,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 19:05:57,291 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:05:57,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:05:57,291 INFO L82 PathProgramCache]: Analyzing trace with hash 139540, now seen corresponding path program 1 times [2020-12-09 19:05:57,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:05:57,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890695238] [2020-12-09 19:05:57,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:05:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:05:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:05:57,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890695238] [2020-12-09 19:05:57,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:05:57,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 19:05:57,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082018638] [2020-12-09 19:05:57,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:05:57,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:05:57,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:05:57,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:05:57,358 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 4 states. [2020-12-09 19:05:57,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:05:57,580 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2020-12-09 19:05:57,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 19:05:57,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2020-12-09 19:05:57,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:05:57,582 INFO L225 Difference]: With dead ends: 132 [2020-12-09 19:05:57,582 INFO L226 Difference]: Without dead ends: 132 [2020-12-09 19:05:57,583 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-12-09 19:05:57,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-12-09 19:05:57,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 67. [2020-12-09 19:05:57,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-12-09 19:05:57,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2020-12-09 19:05:57,591 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 3 [2020-12-09 19:05:57,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:05:57,591 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2020-12-09 19:05:57,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:05:57,591 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-12-09 19:05:57,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 19:05:57,592 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:05:57,592 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 19:05:57,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 19:05:57,592 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:05:57,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:05:57,593 INFO L82 PathProgramCache]: Analyzing trace with hash 4325689, now seen corresponding path program 1 times [2020-12-09 19:05:57,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:05:57,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339152038] [2020-12-09 19:05:57,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:05:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:05:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:05:57,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339152038] [2020-12-09 19:05:57,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:05:57,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 19:05:57,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197754819] [2020-12-09 19:05:57,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:05:57,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:05:57,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:05:57,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:05:57,624 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 3 states. [2020-12-09 19:05:57,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:05:57,671 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2020-12-09 19:05:57,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:05:57,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-12-09 19:05:57,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:05:57,672 INFO L225 Difference]: With dead ends: 73 [2020-12-09 19:05:57,672 INFO L226 Difference]: Without dead ends: 73 [2020-12-09 19:05:57,673 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-12-09 19:05:57,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-12-09 19:05:57,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2020-12-09 19:05:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-09 19:05:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2020-12-09 19:05:57,676 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 4 [2020-12-09 19:05:57,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:05:57,676 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2020-12-09 19:05:57,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:05:57,677 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2020-12-09 19:05:57,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 19:05:57,677 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:05:57,677 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 19:05:57,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 19:05:57,677 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:05:57,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:05:57,678 INFO L82 PathProgramCache]: Analyzing trace with hash 4325690, now seen corresponding path program 1 times [2020-12-09 19:05:57,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:05:57,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164952433] [2020-12-09 19:05:57,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:05:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:05:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:05:57,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164952433] [2020-12-09 19:05:57,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:05:57,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 19:05:57,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430553343] [2020-12-09 19:05:57,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:05:57,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:05:57,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:05:57,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:05:57,705 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 3 states. [2020-12-09 19:05:57,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:05:57,741 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2020-12-09 19:05:57,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:05:57,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-12-09 19:05:57,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:05:57,742 INFO L225 Difference]: With dead ends: 60 [2020-12-09 19:05:57,742 INFO L226 Difference]: Without dead ends: 60 [2020-12-09 19:05:57,742 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-12-09 19:05:57,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-12-09 19:05:57,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2020-12-09 19:05:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-12-09 19:05:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2020-12-09 19:05:57,745 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 4 [2020-12-09 19:05:57,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:05:57,745 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2020-12-09 19:05:57,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:05:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2020-12-09 19:05:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 19:05:57,746 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:05:57,746 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:05:57,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 19:05:57,746 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:05:57,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:05:57,747 INFO L82 PathProgramCache]: Analyzing trace with hash 644298413, now seen corresponding path program 1 times [2020-12-09 19:05:57,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:05:57,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199223673] [2020-12-09 19:05:57,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:05:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:05:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:05:57,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199223673] [2020-12-09 19:05:57,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:05:57,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 19:05:57,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026165912] [2020-12-09 19:05:57,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 19:05:57,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:05:57,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 19:05:57,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 19:05:57,814 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 7 states. [2020-12-09 19:05:57,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:05:57,924 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2020-12-09 19:05:57,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 19:05:57,925 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-12-09 19:05:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:05:57,925 INFO L225 Difference]: With dead ends: 67 [2020-12-09 19:05:57,925 INFO L226 Difference]: Without dead ends: 67 [2020-12-09 19:05:57,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-09 19:05:57,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-12-09 19:05:57,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2020-12-09 19:05:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-09 19:05:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2020-12-09 19:05:57,930 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 8 [2020-12-09 19:05:57,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:05:57,931 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2020-12-09 19:05:57,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 19:05:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2020-12-09 19:05:57,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 19:05:57,931 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:05:57,931 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:05:57,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 19:05:57,932 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:05:57,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:05:57,932 INFO L82 PathProgramCache]: Analyzing trace with hash 644310205, now seen corresponding path program 1 times [2020-12-09 19:05:57,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:05:57,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469396312] [2020-12-09 19:05:57,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:05:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:05:57,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:05:57,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469396312] [2020-12-09 19:05:57,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:05:57,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 19:05:57,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664678027] [2020-12-09 19:05:57,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 19:05:57,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:05:57,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 19:05:57,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:05:57,991 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 6 states. [2020-12-09 19:05:58,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:05:58,064 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2020-12-09 19:05:58,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 19:05:58,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-12-09 19:05:58,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:05:58,065 INFO L225 Difference]: With dead ends: 72 [2020-12-09 19:05:58,065 INFO L226 Difference]: Without dead ends: 72 [2020-12-09 19:05:58,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-09 19:05:58,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-12-09 19:05:58,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2020-12-09 19:05:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-09 19:05:58,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2020-12-09 19:05:58,069 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 8 [2020-12-09 19:05:58,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:05:58,069 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2020-12-09 19:05:58,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 19:05:58,069 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2020-12-09 19:05:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 19:05:58,069 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:05:58,069 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:05:58,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 19:05:58,070 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:05:58,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:05:58,070 INFO L82 PathProgramCache]: Analyzing trace with hash 958644131, now seen corresponding path program 1 times [2020-12-09 19:05:58,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:05:58,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836277333] [2020-12-09 19:05:58,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:05:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:05:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:05:58,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836277333] [2020-12-09 19:05:58,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:05:58,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 19:05:58,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786005029] [2020-12-09 19:05:58,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 19:05:58,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:05:58,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 19:05:58,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:05:58,113 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 6 states. [2020-12-09 19:05:58,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:05:58,207 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2020-12-09 19:05:58,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 19:05:58,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-09 19:05:58,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:05:58,208 INFO L225 Difference]: With dead ends: 69 [2020-12-09 19:05:58,208 INFO L226 Difference]: Without dead ends: 69 [2020-12-09 19:05:58,208 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-12-09 19:05:58,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-12-09 19:05:58,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2020-12-09 19:05:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-12-09 19:05:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2020-12-09 19:05:58,211 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 13 [2020-12-09 19:05:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:05:58,211 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2020-12-09 19:05:58,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 19:05:58,211 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2020-12-09 19:05:58,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 19:05:58,212 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:05:58,212 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:05:58,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 19:05:58,212 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:05:58,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:05:58,212 INFO L82 PathProgramCache]: Analyzing trace with hash 958644132, now seen corresponding path program 1 times [2020-12-09 19:05:58,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:05:58,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432053485] [2020-12-09 19:05:58,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:05:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:05:58,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:05:58,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432053485] [2020-12-09 19:05:58,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:05:58,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 19:05:58,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252264497] [2020-12-09 19:05:58,287 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 19:05:58,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:05:58,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 19:05:58,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:05:58,288 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 6 states. [2020-12-09 19:05:58,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:05:58,393 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2020-12-09 19:05:58,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 19:05:58,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-09 19:05:58,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:05:58,393 INFO L225 Difference]: With dead ends: 71 [2020-12-09 19:05:58,393 INFO L226 Difference]: Without dead ends: 71 [2020-12-09 19:05:58,394 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-12-09 19:05:58,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-09 19:05:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59. [2020-12-09 19:05:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-12-09 19:05:58,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2020-12-09 19:05:58,397 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 13 [2020-12-09 19:05:58,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:05:58,397 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2020-12-09 19:05:58,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 19:05:58,397 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2020-12-09 19:05:58,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 19:05:58,397 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:05:58,397 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:05:58,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 19:05:58,398 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:05:58,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:05:58,398 INFO L82 PathProgramCache]: Analyzing trace with hash 2134065279, now seen corresponding path program 1 times [2020-12-09 19:05:58,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:05:58,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982127789] [2020-12-09 19:05:58,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:05:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:05:58,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:05:58,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982127789] [2020-12-09 19:05:58,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:05:58,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 19:05:58,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171356520] [2020-12-09 19:05:58,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 19:05:58,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:05:58,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 19:05:58,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 19:05:58,433 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 5 states. [2020-12-09 19:05:58,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:05:58,499 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2020-12-09 19:05:58,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 19:05:58,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-09 19:05:58,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:05:58,499 INFO L225 Difference]: With dead ends: 70 [2020-12-09 19:05:58,499 INFO L226 Difference]: Without dead ends: 70 [2020-12-09 19:05:58,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 19:05:58,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-12-09 19:05:58,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 58. [2020-12-09 19:05:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-12-09 19:05:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2020-12-09 19:05:58,502 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 15 [2020-12-09 19:05:58,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:05:58,503 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2020-12-09 19:05:58,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 19:05:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2020-12-09 19:05:58,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 19:05:58,503 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:05:58,503 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:05:58,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 19:05:58,504 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:05:58,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:05:58,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2140791557, now seen corresponding path program 1 times [2020-12-09 19:05:58,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:05:58,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668052897] [2020-12-09 19:05:58,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:05:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:05:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:05:58,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668052897] [2020-12-09 19:05:58,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:05:58,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 19:05:58,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845462526] [2020-12-09 19:05:58,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 19:05:58,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:05:58,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 19:05:58,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 19:05:58,539 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 5 states. [2020-12-09 19:05:58,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:05:58,611 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-12-09 19:05:58,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 19:05:58,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-09 19:05:58,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:05:58,612 INFO L225 Difference]: With dead ends: 53 [2020-12-09 19:05:58,612 INFO L226 Difference]: Without dead ends: 53 [2020-12-09 19:05:58,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 19:05:58,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-12-09 19:05:58,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-12-09 19:05:58,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-09 19:05:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2020-12-09 19:05:58,614 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 15 [2020-12-09 19:05:58,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:05:58,614 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2020-12-09 19:05:58,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 19:05:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-12-09 19:05:58,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 19:05:58,614 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:05:58,615 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:05:58,615 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 19:05:58,615 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:05:58,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:05:58,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1731514306, now seen corresponding path program 1 times [2020-12-09 19:05:58,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:05:58,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667826171] [2020-12-09 19:05:58,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:05:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:05:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:05:58,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667826171] [2020-12-09 19:05:58,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:05:58,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 19:05:58,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916921456] [2020-12-09 19:05:58,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 19:05:58,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:05:58,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 19:05:58,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 19:05:58,658 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states. [2020-12-09 19:05:58,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:05:58,725 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-12-09 19:05:58,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 19:05:58,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-09 19:05:58,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:05:58,726 INFO L225 Difference]: With dead ends: 52 [2020-12-09 19:05:58,726 INFO L226 Difference]: Without dead ends: 52 [2020-12-09 19:05:58,727 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 19:05:58,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-12-09 19:05:58,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-12-09 19:05:58,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-12-09 19:05:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2020-12-09 19:05:58,729 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 16 [2020-12-09 19:05:58,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:05:58,729 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2020-12-09 19:05:58,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 19:05:58,729 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-12-09 19:05:58,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 19:05:58,729 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:05:58,729 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:05:58,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 19:05:58,730 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:05:58,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:05:58,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1040832450, now seen corresponding path program 1 times [2020-12-09 19:05:58,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:05:58,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213302582] [2020-12-09 19:05:58,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:05:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:05:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:05:58,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213302582] [2020-12-09 19:05:58,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368669219] [2020-12-09 19:05:58,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/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-12-09 19:05:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:05:58,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 34 conjunts are in the unsatisfiable core [2020-12-09 19:05:58,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:05:58,953 INFO L382 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-12-09 19:05:58,954 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:05:58,962 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:05:58,963 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:05:58,963 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2020-12-09 19:05:59,043 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:05:59,044 INFO L382 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-12-09 19:05:59,047 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:05:59,069 INFO L625 ElimStorePlain]: treesize reduction 14, result has 62.2 percent of original size [2020-12-09 19:05:59,071 INFO L547 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-12-09 19:05:59,072 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2020-12-09 19:05:59,116 INFO L382 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-12-09 19:05:59,116 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:05:59,125 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:05:59,129 INFO L547 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-12-09 19:05:59,130 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:19 [2020-12-09 19:05:59,186 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:05:59,186 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2020-12-09 19:05:59,188 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:05:59,207 INFO L625 ElimStorePlain]: treesize reduction 26, result has 48.0 percent of original size [2020-12-09 19:05:59,209 INFO L547 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-12-09 19:05:59,209 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2020-12-09 19:05:59,293 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 19:05:59,309 INFO L348 Elim1Store]: treesize reduction 48, result has 27.3 percent of original size [2020-12-09 19:05:59,309 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 30 [2020-12-09 19:05:59,310 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:05:59,327 INFO L625 ElimStorePlain]: treesize reduction 11, result has 76.1 percent of original size [2020-12-09 19:05:59,330 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 19:05:59,330 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:32 [2020-12-09 19:05:59,394 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:05:59,394 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2020-12-09 19:05:59,395 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:05:59,400 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:05:59,402 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:05:59,402 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:11 [2020-12-09 19:05:59,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:05:59,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:05:59,464 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2020-12-09 19:05:59,466 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:05:59,477 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:05:59,478 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:05:59,478 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2020-12-09 19:06:05,643 WARN L197 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 32 [2020-12-09 19:06:09,704 WARN L197 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 34 [2020-12-09 19:06:09,713 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:06:09,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [529416101] [2020-12-09 19:06:09,728 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2020-12-09 19:06:09,728 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 19:06:09,732 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 19:06:09,736 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 19:06:09,736 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 19:06:10,539 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:06:10,549 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:06:10,554 WARN L220 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:06:11,348 WARN L220 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:06:11,363 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:06:11,378 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:06:11,385 WARN L220 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:06:11,398 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:06:11,410 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:06:11,941 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 19:06:12,084 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2020-12-09 19:06:12,617 WARN L197 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 119 [2020-12-09 19:06:13,395 WARN L197 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 124 [2020-12-09 19:06:14,252 WARN L197 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 130 [2020-12-09 19:06:15,174 WARN L197 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 121 [2020-12-09 19:06:16,132 WARN L197 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 126 [2020-12-09 19:06:16,809 WARN L197 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 118 [2020-12-09 19:06:17,409 WARN L197 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 112 [2020-12-09 19:06:17,797 WARN L197 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 118 [2020-12-09 19:06:18,087 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 19:06:18,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 19:06:18,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 10] total 21 [2020-12-09 19:06:18,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260627838] [2020-12-09 19:06:18,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 19:06:18,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:06:18,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 19:06:18,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=873, Unknown=1, NotChecked=0, Total=1056 [2020-12-09 19:06:18,088 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 22 states. [2020-12-09 19:06:18,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:06:18,511 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2020-12-09 19:06:18,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 19:06:18,511 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 16 [2020-12-09 19:06:18,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:06:18,512 INFO L225 Difference]: With dead ends: 65 [2020-12-09 19:06:18,512 INFO L226 Difference]: Without dead ends: 65 [2020-12-09 19:06:18,513 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=340, Invalid=1299, Unknown=1, NotChecked=0, Total=1640 [2020-12-09 19:06:18,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-09 19:06:18,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2020-12-09 19:06:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-09 19:06:18,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2020-12-09 19:06:18,514 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 16 [2020-12-09 19:06:18,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:06:18,514 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2020-12-09 19:06:18,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 19:06:18,514 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2020-12-09 19:06:18,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 19:06:18,515 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:06:18,515 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:06:18,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-09 19:06:18,717 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:06:18,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:06:18,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1040832451, now seen corresponding path program 1 times [2020-12-09 19:06:18,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:06:18,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099828039] [2020-12-09 19:06:18,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:06:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:06:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:06:18,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099828039] [2020-12-09 19:06:18,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930499274] [2020-12-09 19:06:18,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/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-12-09 19:06:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:06:18,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 46 conjunts are in the unsatisfiable core [2020-12-09 19:06:18,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:06:19,249 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:06:19,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:06:20,005 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2020-12-09 19:06:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:06:20,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1914336785] [2020-12-09 19:06:20,024 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2020-12-09 19:06:20,024 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 19:06:20,024 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 19:06:20,024 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 19:06:20,024 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 19:06:20,148 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:06:20,616 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:06:20,627 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:06:20,632 WARN L220 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:06:21,150 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:06:21,156 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 19:06:21,331 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2020-12-09 19:06:21,905 WARN L197 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 120 [2020-12-09 19:06:22,459 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 75 [2020-12-09 19:06:22,951 WARN L197 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 118 [2020-12-09 19:06:23,292 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2020-12-09 19:06:23,293 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 19:06:23,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 19:06:23,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 10] total 24 [2020-12-09 19:06:23,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618764055] [2020-12-09 19:06:23,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-09 19:06:23,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:06:23,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-09 19:06:23,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1048, Unknown=0, NotChecked=0, Total=1190 [2020-12-09 19:06:23,295 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 25 states. [2020-12-09 19:06:23,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:06:23,750 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2020-12-09 19:06:23,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 19:06:23,751 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 16 [2020-12-09 19:06:23,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:06:23,751 INFO L225 Difference]: With dead ends: 67 [2020-12-09 19:06:23,751 INFO L226 Difference]: Without dead ends: 67 [2020-12-09 19:06:23,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=223, Invalid=1259, Unknown=0, NotChecked=0, Total=1482 [2020-12-09 19:06:23,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-12-09 19:06:23,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2020-12-09 19:06:23,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-12-09 19:06:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2020-12-09 19:06:23,754 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 16 [2020-12-09 19:06:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:06:23,754 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2020-12-09 19:06:23,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-09 19:06:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2020-12-09 19:06:23,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 19:06:23,755 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:06:23,755 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:06:23,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:06:23,956 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:06:23,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:06:23,956 INFO L82 PathProgramCache]: Analyzing trace with hash 2137336033, now seen corresponding path program 1 times [2020-12-09 19:06:23,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:06:23,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735965499] [2020-12-09 19:06:23,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:06:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:06:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:06:23,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735965499] [2020-12-09 19:06:23,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:06:23,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 19:06:23,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719475541] [2020-12-09 19:06:23,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 19:06:23,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:06:23,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 19:06:23,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 19:06:23,992 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 5 states. [2020-12-09 19:06:24,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:06:24,064 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-12-09 19:06:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 19:06:24,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-12-09 19:06:24,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:06:24,065 INFO L225 Difference]: With dead ends: 49 [2020-12-09 19:06:24,066 INFO L226 Difference]: Without dead ends: 49 [2020-12-09 19:06:24,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:06:24,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-12-09 19:06:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-12-09 19:06:24,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-12-09 19:06:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2020-12-09 19:06:24,068 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 17 [2020-12-09 19:06:24,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:06:24,068 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2020-12-09 19:06:24,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 19:06:24,068 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-12-09 19:06:24,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 19:06:24,069 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:06:24,069 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:06:24,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2020-12-09 19:06:24,069 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:06:24,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:06:24,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1832907685, now seen corresponding path program 1 times [2020-12-09 19:06:24,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:06:24,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455654223] [2020-12-09 19:06:24,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:06:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:06:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:06:24,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455654223] [2020-12-09 19:06:24,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:06:24,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 19:06:24,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600235598] [2020-12-09 19:06:24,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 19:06:24,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:06:24,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 19:06:24,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:06:24,119 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 6 states. [2020-12-09 19:06:24,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:06:24,195 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2020-12-09 19:06:24,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 19:06:24,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-09 19:06:24,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:06:24,195 INFO L225 Difference]: With dead ends: 48 [2020-12-09 19:06:24,195 INFO L226 Difference]: Without dead ends: 48 [2020-12-09 19:06:24,196 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-12-09 19:06:24,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-12-09 19:06:24,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-12-09 19:06:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-12-09 19:06:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2020-12-09 19:06:24,197 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 18 [2020-12-09 19:06:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:06:24,197 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2020-12-09 19:06:24,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 19:06:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2020-12-09 19:06:24,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 19:06:24,198 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:06:24,198 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:06:24,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2020-12-09 19:06:24,199 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:06:24,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:06:24,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1832907686, now seen corresponding path program 1 times [2020-12-09 19:06:24,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:06:24,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254385526] [2020-12-09 19:06:24,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:06:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:06:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:06:24,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254385526] [2020-12-09 19:06:24,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:06:24,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 19:06:24,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26143518] [2020-12-09 19:06:24,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:06:24,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:06:24,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:06:24,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:06:24,228 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 4 states. [2020-12-09 19:06:24,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:06:24,264 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-12-09 19:06:24,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:06:24,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-12-09 19:06:24,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:06:24,265 INFO L225 Difference]: With dead ends: 43 [2020-12-09 19:06:24,265 INFO L226 Difference]: Without dead ends: 43 [2020-12-09 19:06:24,266 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-12-09 19:06:24,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-12-09 19:06:24,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-12-09 19:06:24,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-12-09 19:06:24,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2020-12-09 19:06:24,267 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 18 [2020-12-09 19:06:24,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:06:24,267 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2020-12-09 19:06:24,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:06:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-12-09 19:06:24,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 19:06:24,268 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:06:24,268 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:06:24,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2020-12-09 19:06:24,268 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:06:24,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:06:24,269 INFO L82 PathProgramCache]: Analyzing trace with hash 523940843, now seen corresponding path program 1 times [2020-12-09 19:06:24,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:06:24,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090109641] [2020-12-09 19:06:24,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:06:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 19:06:24,291 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 19:06:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 19:06:24,311 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 19:06:24,330 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 19:06:24,330 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 19:06:24,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2020-12-09 19:06:24,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:06:24 BoogieIcfgContainer [2020-12-09 19:06:24,356 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 19:06:24,357 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 19:06:24,357 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 19:06:24,357 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 19:06:24,357 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:05:56" (3/4) ... [2020-12-09 19:06:24,359 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-09 19:06:24,359 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 19:06:24,360 INFO L168 Benchmark]: Toolchain (without parser) took 28319.49 ms. Allocated memory was 117.4 MB in the beginning and 172.0 MB in the end (delta: 54.5 MB). Free memory was 93.6 MB in the beginning and 66.0 MB in the end (delta: 27.6 MB). Peak memory consumption was 80.6 MB. Max. memory is 16.1 GB. [2020-12-09 19:06:24,360 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 117.4 MB. Free memory is still 82.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 19:06:24,360 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.33 ms. Allocated memory is still 117.4 MB. Free memory was 93.6 MB in the beginning and 81.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 19:06:24,360 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.67 ms. Allocated memory is still 117.4 MB. Free memory was 81.6 MB in the beginning and 79.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 19:06:24,360 INFO L168 Benchmark]: Boogie Preprocessor took 24.30 ms. Allocated memory is still 117.4 MB. Free memory was 79.8 MB in the beginning and 78.3 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 19:06:24,361 INFO L168 Benchmark]: RCFGBuilder took 430.96 ms. Allocated memory is still 117.4 MB. Free memory was 78.3 MB in the beginning and 86.9 MB in the end (delta: -8.6 MB). Peak memory consumption was 33.8 MB. Max. memory is 16.1 GB. [2020-12-09 19:06:24,361 INFO L168 Benchmark]: TraceAbstraction took 27500.65 ms. Allocated memory was 117.4 MB in the beginning and 172.0 MB in the end (delta: 54.5 MB). Free memory was 86.4 MB in the beginning and 67.1 MB in the end (delta: 19.3 MB). Peak memory consumption was 74.9 MB. Max. memory is 16.1 GB. [2020-12-09 19:06:24,361 INFO L168 Benchmark]: Witness Printer took 2.56 ms. Allocated memory is still 172.0 MB. Free memory was 67.1 MB in the beginning and 66.0 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 19:06:24,362 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.12 ms. Allocated memory is still 117.4 MB. Free memory is still 82.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 318.33 ms. Allocated memory is still 117.4 MB. Free memory was 93.6 MB in the beginning and 81.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 37.67 ms. Allocated memory is still 117.4 MB. Free memory was 81.6 MB in the beginning and 79.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 24.30 ms. Allocated memory is still 117.4 MB. Free memory was 79.8 MB in the beginning and 78.3 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 430.96 ms. Allocated memory is still 117.4 MB. Free memory was 78.3 MB in the beginning and 86.9 MB in the end (delta: -8.6 MB). Peak memory consumption was 33.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 27500.65 ms. Allocated memory was 117.4 MB in the beginning and 172.0 MB in the end (delta: 54.5 MB). Free memory was 86.4 MB in the beginning and 67.1 MB in the end (delta: 19.3 MB). Peak memory consumption was 74.9 MB. Max. memory is 16.1 GB. * Witness Printer took 2.56 ms. Allocated memory is still 172.0 MB. Free memory was 67.1 MB in the beginning and 66.0 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 537]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 537. Possible FailurePath: [L539] struct item *list = ((void *)0); [L530] struct item *item = malloc(sizeof *item); [L531] EXPR \read(**plist) [L531] item->next = *plist [L532] EXPR item->next [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L532-L534] item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L535] *plist = item [L542] COND FALSE !(__VERIFIER_nondet_int()) [L543] \read(*list) [L543] COND TRUE \read(*list) [L544] EXPR \read(*list) [L544] EXPR list->next [L544] struct item *next = list->next; [L545] EXPR \read(*list) [L545] free(list) [L545] free(list) [L545] free(list) [L546] list = next [L548] \read(*list) [L548] COND FALSE !(\read(*list)) [L553] return 0; [L539] struct item *list = ((void *)0); [L553] return 0; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 73 locations, 41 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 27.4s, OverallIterations: 17, TraceHistogramMax: 2, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 438 SDtfs, 1568 SDslu, 765 SDs, 0 SdLazy, 1751 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 20.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 172 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 231 ConstructedInterpolants, 26 QuantifiedInterpolants, 45301 SizeOfPredicates, 48 NumberOfNonLiveVariables, 330 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 4/30 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... ### Bit-precise run ### This is Ultimate 0.2.0-7b2dab5 [2020-12-09 19:06:25,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 19:06:25,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 19:06:25,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 19:06:25,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 19:06:25,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 19:06:25,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 19:06:25,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 19:06:25,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 19:06:25,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 19:06:25,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 19:06:25,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 19:06:25,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 19:06:25,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 19:06:25,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 19:06:25,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 19:06:25,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 19:06:25,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 19:06:25,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 19:06:25,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 19:06:25,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 19:06:25,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 19:06:25,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 19:06:25,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 19:06:25,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 19:06:25,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 19:06:25,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 19:06:25,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 19:06:25,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 19:06:25,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 19:06:25,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 19:06:25,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 19:06:25,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 19:06:25,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 19:06:25,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 19:06:25,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 19:06:25,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 19:06:25,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 19:06:25,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 19:06:25,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 19:06:25,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 19:06:25,909 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2020-12-09 19:06:25,927 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 19:06:25,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 19:06:25,928 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 19:06:25,928 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 19:06:25,929 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 19:06:25,929 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 19:06:25,929 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 19:06:25,929 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 19:06:25,929 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 19:06:25,930 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 19:06:25,930 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 19:06:25,930 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 19:06:25,930 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 19:06:25,930 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 19:06:25,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 19:06:25,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 19:06:25,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 19:06:25,931 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 19:06:25,931 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 19:06:25,931 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 19:06:25,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 19:06:25,931 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 19:06:25,931 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 19:06:25,931 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 19:06:25,931 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 19:06:25,932 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 19:06:25,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 19:06:25,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 19:06:25,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 19:06:25,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 19:06:25,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 19:06:25,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 19:06:25,933 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 19:06:25,933 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 19:06:25,933 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 19:06:25,933 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 19:06:25,933 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_c918000f-8927-46b5-963f-4d905575f8d5/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_c918000f-8927-46b5-963f-4d905575f8d5/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 -> aeec7a18a8140b87b664dd42e07dd87d1c028ac9 [2020-12-09 19:06:26,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 19:06:26,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 19:06:26,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 19:06:26,176 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 19:06:26,177 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 19:06:26,178 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/../../sv-benchmarks/c/memsafety/test-0232-1.i [2020-12-09 19:06:26,223 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/data/2e9709b12/bd3397a8447440d48ff701909a65215c/FLAGbc6bcebf7 [2020-12-09 19:06:26,640 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 19:06:26,640 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/sv-benchmarks/c/memsafety/test-0232-1.i [2020-12-09 19:06:26,651 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/data/2e9709b12/bd3397a8447440d48ff701909a65215c/FLAGbc6bcebf7 [2020-12-09 19:06:26,664 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/data/2e9709b12/bd3397a8447440d48ff701909a65215c [2020-12-09 19:06:26,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 19:06:26,668 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 19:06:26,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 19:06:26,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 19:06:26,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 19:06:26,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:06:26" (1/1) ... [2020-12-09 19:06:26,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d3518a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:06:26, skipping insertion in model container [2020-12-09 19:06:26,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:06:26" (1/1) ... [2020-12-09 19:06:26,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 19:06:26,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 19:06:26,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:06:26,929 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 19:06:26,960 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:06:27,001 INFO L208 MainTranslator]: Completed translation [2020-12-09 19:06:27,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:06:27 WrapperNode [2020-12-09 19:06:27,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 19:06:27,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 19:06:27,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 19:06:27,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 19:06:27,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:06:27" (1/1) ... [2020-12-09 19:06:27,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:06:27" (1/1) ... [2020-12-09 19:06:27,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 19:06:27,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 19:06:27,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 19:06:27,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 19:06:27,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:06:27" (1/1) ... [2020-12-09 19:06:27,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:06:27" (1/1) ... [2020-12-09 19:06:27,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:06:27" (1/1) ... [2020-12-09 19:06:27,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:06:27" (1/1) ... [2020-12-09 19:06:27,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:06:27" (1/1) ... [2020-12-09 19:06:27,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:06:27" (1/1) ... [2020-12-09 19:06:27,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:06:27" (1/1) ... [2020-12-09 19:06:27,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 19:06:27,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 19:06:27,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 19:06:27,067 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 19:06:27,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:06:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/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-12-09 19:06:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 19:06:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-09 19:06:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 19:06:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 19:06:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 19:06:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-09 19:06:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-09 19:06:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 19:06:27,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 19:06:27,566 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 19:06:27,566 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2020-12-09 19:06:27,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:06:27 BoogieIcfgContainer [2020-12-09 19:06:27,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 19:06:27,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 19:06:27,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 19:06:27,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 19:06:27,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:06:26" (1/3) ... [2020-12-09 19:06:27,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e5c580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:06:27, skipping insertion in model container [2020-12-09 19:06:27,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:06:27" (2/3) ... [2020-12-09 19:06:27,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e5c580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:06:27, skipping insertion in model container [2020-12-09 19:06:27,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:06:27" (3/3) ... [2020-12-09 19:06:27,575 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232-1.i [2020-12-09 19:06:27,588 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 19:06:27,591 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2020-12-09 19:06:27,599 INFO L253 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2020-12-09 19:06:27,613 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 19:06:27,613 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 19:06:27,614 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 19:06:27,614 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 19:06:27,614 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 19:06:27,614 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 19:06:27,614 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 19:06:27,614 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 19:06:27,625 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2020-12-09 19:06:27,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 19:06:27,629 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:06:27,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 19:06:27,630 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:06:27,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:06:27,635 INFO L82 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2020-12-09 19:06:27,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:06:27,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812675362] [2020-12-09 19:06:27,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/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-12-09 19:06:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:06:27,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 19:06:27,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:06:27,758 INFO L382 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-12-09 19:06:27,759 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:27,763 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:27,764 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:06:27,764 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 19:06:27,807 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:27,808 INFO L382 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 19 treesize of output 41 [2020-12-09 19:06:27,813 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:27,819 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:27,824 INFO L547 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-12-09 19:06:27,825 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2020-12-09 19:06:27,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:06:27,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:06:27,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812675362] [2020-12-09 19:06:27,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:06:27,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:06:27,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416793622] [2020-12-09 19:06:27,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:06:27,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:06:27,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:06:27,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:06:27,856 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 4 states. [2020-12-09 19:06:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:06:28,104 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2020-12-09 19:06:28,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 19:06:28,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-12-09 19:06:28,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:06:28,111 INFO L225 Difference]: With dead ends: 91 [2020-12-09 19:06:28,111 INFO L226 Difference]: Without dead ends: 89 [2020-12-09 19:06:28,112 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-12-09 19:06:28,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-12-09 19:06:28,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 70. [2020-12-09 19:06:28,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-12-09 19:06:28,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2020-12-09 19:06:28,136 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 4 [2020-12-09 19:06:28,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:06:28,136 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2020-12-09 19:06:28,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:06:28,137 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2020-12-09 19:06:28,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 19:06:28,137 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:06:28,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 19:06:28,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 19:06:28,340 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:06:28,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:06:28,342 INFO L82 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2020-12-09 19:06:28,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:06:28,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306662663] [2020-12-09 19:06:28,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/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-12-09 19:06:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:06:28,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 19:06:28,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:06:28,444 INFO L382 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-12-09 19:06:28,444 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:28,451 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:28,454 INFO L382 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-12-09 19:06:28,454 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:28,460 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:28,461 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:06:28,461 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-12-09 19:06:28,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:06:28,491 INFO L382 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-12-09 19:06:28,493 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:28,502 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:28,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:06:28,506 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 19:06:28,508 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:28,514 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:28,516 INFO L547 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-12-09 19:06:28,516 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2020-12-09 19:06:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:06:28,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:06:28,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306662663] [2020-12-09 19:06:28,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:06:28,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:06:28,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554541593] [2020-12-09 19:06:28,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:06:28,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:06:28,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:06:28,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:06:28,531 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 4 states. [2020-12-09 19:06:28,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:06:28,956 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2020-12-09 19:06:28,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 19:06:28,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-12-09 19:06:28,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:06:28,958 INFO L225 Difference]: With dead ends: 143 [2020-12-09 19:06:28,959 INFO L226 Difference]: Without dead ends: 143 [2020-12-09 19:06:28,959 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-12-09 19:06:28,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-12-09 19:06:28,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 75. [2020-12-09 19:06:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-09 19:06:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2020-12-09 19:06:28,966 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 4 [2020-12-09 19:06:28,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:06:28,966 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2020-12-09 19:06:28,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:06:28,966 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2020-12-09 19:06:28,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 19:06:28,967 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:06:28,967 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 19:06:29,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 19:06:29,169 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:06:29,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:06:29,171 INFO L82 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2020-12-09 19:06:29,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:06:29,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491592297] [2020-12-09 19:06:29,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/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-12-09 19:06:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:06:29,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 19:06:29,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:06:29,279 INFO L382 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-12-09 19:06:29,280 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:29,282 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:29,283 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:06:29,283 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 19:06:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:06:29,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:06:29,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491592297] [2020-12-09 19:06:29,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:06:29,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 19:06:29,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646385622] [2020-12-09 19:06:29,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:06:29,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:06:29,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:06:29,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:06:29,291 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 3 states. [2020-12-09 19:06:29,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:06:29,411 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2020-12-09 19:06:29,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:06:29,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 19:06:29,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:06:29,412 INFO L225 Difference]: With dead ends: 81 [2020-12-09 19:06:29,412 INFO L226 Difference]: Without dead ends: 81 [2020-12-09 19:06:29,413 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:06:29,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-12-09 19:06:29,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2020-12-09 19:06:29,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-09 19:06:29,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2020-12-09 19:06:29,417 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 5 [2020-12-09 19:06:29,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:06:29,418 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2020-12-09 19:06:29,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:06:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2020-12-09 19:06:29,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 19:06:29,418 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:06:29,418 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 19:06:29,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 19:06:29,620 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:06:29,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:06:29,622 INFO L82 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2020-12-09 19:06:29,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:06:29,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952627751] [2020-12-09 19:06:29,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/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-12-09 19:06:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:06:29,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 19:06:29,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:06:29,720 INFO L382 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-12-09 19:06:29,721 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:29,728 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:29,729 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:06:29,729 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:11 [2020-12-09 19:06:29,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:06:29,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:06:29,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952627751] [2020-12-09 19:06:29,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:06:29,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 19:06:29,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983821171] [2020-12-09 19:06:29,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:06:29,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:06:29,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:06:29,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:06:29,739 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 3 states. [2020-12-09 19:06:29,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:06:29,840 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2020-12-09 19:06:29,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:06:29,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 19:06:29,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:06:29,841 INFO L225 Difference]: With dead ends: 68 [2020-12-09 19:06:29,841 INFO L226 Difference]: Without dead ends: 68 [2020-12-09 19:06:29,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:06:29,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-12-09 19:06:29,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2020-12-09 19:06:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-12-09 19:06:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2020-12-09 19:06:29,845 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 5 [2020-12-09 19:06:29,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:06:29,845 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2020-12-09 19:06:29,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:06:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2020-12-09 19:06:29,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 19:06:29,846 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:06:29,846 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:06:30,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 19:06:30,048 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:06:30,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:06:30,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2020-12-09 19:06:30,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:06:30,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141278249] [2020-12-09 19:06:30,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/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-12-09 19:06:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:06:30,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 19:06:30,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:06:30,192 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 19:06:30,192 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2020-12-09 19:06:30,194 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:30,209 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:30,231 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 19:06:30,231 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2020-12-09 19:06:30,232 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:30,243 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:30,245 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 19:06:30,245 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2020-12-09 19:06:30,299 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:30,300 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2020-12-09 19:06:30,301 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:30,313 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:30,324 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:30,324 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2020-12-09 19:06:30,325 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:30,329 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:30,330 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:06:30,330 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:47, output treesize:7 [2020-12-09 19:06:30,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:06:30,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:06:30,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141278249] [2020-12-09 19:06:30,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:06:30,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 19:06:30,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96903766] [2020-12-09 19:06:30,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 19:06:30,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:06:30,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 19:06:30,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 19:06:30,350 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 7 states. [2020-12-09 19:06:30,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:06:30,813 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2020-12-09 19:06:30,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 19:06:30,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2020-12-09 19:06:30,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:06:30,814 INFO L225 Difference]: With dead ends: 77 [2020-12-09 19:06:30,814 INFO L226 Difference]: Without dead ends: 77 [2020-12-09 19:06:30,815 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-12-09 19:06:30,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-12-09 19:06:30,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2020-12-09 19:06:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-12-09 19:06:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2020-12-09 19:06:30,818 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 10 [2020-12-09 19:06:30,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:06:30,818 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2020-12-09 19:06:30,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 19:06:30,818 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2020-12-09 19:06:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 19:06:30,819 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:06:30,819 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:06:31,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 19:06:31,020 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:06:31,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:06:31,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1762075788, now seen corresponding path program 1 times [2020-12-09 19:06:31,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:06:31,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363409027] [2020-12-09 19:06:31,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/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-12-09 19:06:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:06:31,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 19:06:31,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:06:31,215 INFO L382 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-12-09 19:06:31,216 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:31,220 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:31,221 INFO L547 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-12-09 19:06:31,221 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:10, output treesize:9 [2020-12-09 19:06:31,266 INFO L443 ElimStorePlain]: Different costs {1=[|v_#valid_60|], 3=[|v_#length_48|]} [2020-12-09 19:06:31,276 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:31,277 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 19:06:31,278 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:31,294 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:31,315 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:31,315 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 46 [2020-12-09 19:06:31,318 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:31,350 INFO L625 ElimStorePlain]: treesize reduction 26, result has 50.9 percent of original size [2020-12-09 19:06:31,352 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 19:06:31,352 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:27 [2020-12-09 19:06:31,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-12-09 19:06:31,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:06:31,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363409027] [2020-12-09 19:06:31,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:06:31,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 19:06:31,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888420653] [2020-12-09 19:06:31,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 19:06:31,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:06:31,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 19:06:31,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:06:31,397 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 6 states. [2020-12-09 19:06:31,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:06:31,808 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2020-12-09 19:06:31,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 19:06:31,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-12-09 19:06:31,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:06:31,809 INFO L225 Difference]: With dead ends: 138 [2020-12-09 19:06:31,809 INFO L226 Difference]: Without dead ends: 138 [2020-12-09 19:06:31,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-12-09 19:06:31,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-12-09 19:06:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 69. [2020-12-09 19:06:31,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-12-09 19:06:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2020-12-09 19:06:31,814 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 11 [2020-12-09 19:06:31,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:06:31,814 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2020-12-09 19:06:31,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 19:06:31,814 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2020-12-09 19:06:31,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 19:06:31,815 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:06:31,815 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:06:32,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 19:06:32,017 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:06:32,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:06:32,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2141457576, now seen corresponding path program 1 times [2020-12-09 19:06:32,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:06:32,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343225588] [2020-12-09 19:06:32,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/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-12-09 19:06:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:06:32,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 19:06:32,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:06:32,153 INFO L382 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-12-09 19:06:32,154 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:32,158 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:32,159 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:06:32,159 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2020-12-09 19:06:32,170 INFO L382 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-12-09 19:06:32,170 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:32,172 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:32,172 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:06:32,172 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2020-12-09 19:06:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:06:32,180 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:06:32,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343225588] [2020-12-09 19:06:32,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:06:32,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 19:06:32,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138156972] [2020-12-09 19:06:32,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 19:06:32,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:06:32,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 19:06:32,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:06:32,181 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2020-12-09 19:06:32,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:06:32,466 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2020-12-09 19:06:32,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 19:06:32,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-09 19:06:32,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:06:32,467 INFO L225 Difference]: With dead ends: 77 [2020-12-09 19:06:32,467 INFO L226 Difference]: Without dead ends: 77 [2020-12-09 19:06:32,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 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-12-09 19:06:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-12-09 19:06:32,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2020-12-09 19:06:32,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-09 19:06:32,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2020-12-09 19:06:32,470 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 16 [2020-12-09 19:06:32,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:06:32,471 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2020-12-09 19:06:32,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 19:06:32,471 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2020-12-09 19:06:32,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 19:06:32,471 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:06:32,471 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:06:32,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-09 19:06:32,673 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:06:32,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:06:32,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2141457577, now seen corresponding path program 1 times [2020-12-09 19:06:32,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:06:32,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681831376] [2020-12-09 19:06:32,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/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-12-09 19:06:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:06:32,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 19:06:32,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:06:32,777 INFO L382 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-12-09 19:06:32,778 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:32,787 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:32,790 INFO L382 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-12-09 19:06:32,790 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:32,797 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:32,798 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:06:32,798 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2020-12-09 19:06:32,818 INFO L382 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-12-09 19:06:32,819 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:32,826 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:32,828 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-12-09 19:06:32,829 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:32,833 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:32,833 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:06:32,833 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2020-12-09 19:06:32,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-12-09 19:06:32,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:06:32,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681831376] [2020-12-09 19:06:32,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:06:32,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 19:06:32,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387433336] [2020-12-09 19:06:32,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 19:06:32,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:06:32,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 19:06:32,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:06:32,846 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 6 states. [2020-12-09 19:06:33,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:06:33,105 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2020-12-09 19:06:33,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 19:06:33,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-09 19:06:33,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:06:33,106 INFO L225 Difference]: With dead ends: 79 [2020-12-09 19:06:33,106 INFO L226 Difference]: Without dead ends: 79 [2020-12-09 19:06:33,107 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 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-12-09 19:06:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-12-09 19:06:33,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2020-12-09 19:06:33,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-12-09 19:06:33,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2020-12-09 19:06:33,111 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 16 [2020-12-09 19:06:33,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:06:33,111 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2020-12-09 19:06:33,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 19:06:33,111 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2020-12-09 19:06:33,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 19:06:33,112 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:06:33,112 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:06:33,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-12-09 19:06:33,314 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:06:33,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:06:33,315 INFO L82 PathProgramCache]: Analyzing trace with hash 671562912, now seen corresponding path program 1 times [2020-12-09 19:06:33,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:06:33,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359293306] [2020-12-09 19:06:33,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/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-12-09 19:06:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:06:33,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 19:06:33,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:06:33,407 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 19:06:33,408 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:33,415 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:33,416 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:06:33,416 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2020-12-09 19:06:33,425 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2020-12-09 19:06:33,425 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:33,427 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:33,427 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:06:33,427 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2020-12-09 19:06:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:06:33,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:06:33,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359293306] [2020-12-09 19:06:33,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:06:33,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 19:06:33,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516105023] [2020-12-09 19:06:33,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 19:06:33,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:06:33,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 19:06:33,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 19:06:33,435 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 5 states. [2020-12-09 19:06:33,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:06:33,622 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-12-09 19:06:33,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 19:06:33,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-12-09 19:06:33,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:06:33,623 INFO L225 Difference]: With dead ends: 61 [2020-12-09 19:06:33,623 INFO L226 Difference]: Without dead ends: 61 [2020-12-09 19:06:33,624 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 19:06:33,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-12-09 19:06:33,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-12-09 19:06:33,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-09 19:06:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2020-12-09 19:06:33,626 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 18 [2020-12-09 19:06:33,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:06:33,626 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2020-12-09 19:06:33,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 19:06:33,626 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-12-09 19:06:33,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 19:06:33,626 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:06:33,626 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:06:33,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-12-09 19:06:33,828 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:06:33,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:06:33,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1281539337, now seen corresponding path program 1 times [2020-12-09 19:06:33,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:06:33,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143068116] [2020-12-09 19:06:33,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/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-12-09 19:06:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:06:33,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 19:06:33,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:06:33,963 INFO L382 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-12-09 19:06:33,963 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:33,965 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:33,965 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:06:33,965 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-12-09 19:06:33,976 INFO L382 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-12-09 19:06:33,976 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:33,978 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:33,978 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:06:33,978 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-12-09 19:06:33,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:06:33,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:06:33,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143068116] [2020-12-09 19:06:33,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:06:33,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 19:06:33,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246761423] [2020-12-09 19:06:33,984 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 19:06:33,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:06:33,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 19:06:33,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 19:06:33,985 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 5 states. [2020-12-09 19:06:34,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:06:34,137 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2020-12-09 19:06:34,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 19:06:34,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-12-09 19:06:34,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:06:34,138 INFO L225 Difference]: With dead ends: 60 [2020-12-09 19:06:34,138 INFO L226 Difference]: Without dead ends: 60 [2020-12-09 19:06:34,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 19:06:34,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-12-09 19:06:34,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-12-09 19:06:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-12-09 19:06:34,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2020-12-09 19:06:34,140 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 19 [2020-12-09 19:06:34,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:06:34,140 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2020-12-09 19:06:34,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 19:06:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2020-12-09 19:06:34,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 19:06:34,141 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:06:34,141 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:06:34,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-12-09 19:06:34,343 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:06:34,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:06:34,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1073013687, now seen corresponding path program 1 times [2020-12-09 19:06:34,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:06:34,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369302394] [2020-12-09 19:06:34,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-12-09 19:06:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:06:34,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 19:06:34,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:06:34,530 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 19:06:34,530 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:34,539 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:34,540 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:06:34,540 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2020-12-09 19:06:34,564 INFO L382 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 23 treesize of output 11 [2020-12-09 19:06:34,565 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:34,571 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:34,571 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:06:34,571 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2020-12-09 19:06:34,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:06:34,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:06:34,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369302394] [2020-12-09 19:06:34,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:06:34,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 19:06:34,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775612066] [2020-12-09 19:06:34,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 19:06:34,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:06:34,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 19:06:34,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:06:34,590 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 6 states. [2020-12-09 19:06:34,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:06:34,868 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-12-09 19:06:34,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 19:06:34,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-12-09 19:06:34,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:06:34,869 INFO L225 Difference]: With dead ends: 59 [2020-12-09 19:06:34,869 INFO L226 Difference]: Without dead ends: 59 [2020-12-09 19:06:34,869 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-09 19:06:34,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-12-09 19:06:34,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-12-09 19:06:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-12-09 19:06:34,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2020-12-09 19:06:34,871 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 20 [2020-12-09 19:06:34,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:06:34,871 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2020-12-09 19:06:34,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 19:06:34,871 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-12-09 19:06:34,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 19:06:34,872 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:06:34,872 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:06:35,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-12-09 19:06:35,073 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:06:35,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:06:35,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1388841298, now seen corresponding path program 1 times [2020-12-09 19:06:35,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:06:35,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776494720] [2020-12-09 19:06:35,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-12-09 19:06:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:06:35,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 19:06:35,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:06:35,280 INFO L382 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-12-09 19:06:35,280 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:35,284 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:35,285 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:06:35,285 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2020-12-09 19:06:35,310 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:35,311 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 59 [2020-12-09 19:06:35,312 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:35,318 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:35,319 INFO L547 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-12-09 19:06:35,319 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:23 [2020-12-09 19:06:35,374 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 19:06:35,374 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2020-12-09 19:06:35,375 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:35,385 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:35,386 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-09 19:06:35,387 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:36 [2020-12-09 19:06:35,437 INFO L382 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-12-09 19:06:35,437 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:35,442 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:35,443 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:06:35,443 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2020-12-09 19:06:35,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:06:35,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:06:39,001 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2020-12-09 19:06:39,002 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:06:39,030 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:39,032 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:06:39,032 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:06:39,034 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:06:39,036 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 19:06:39,036 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:40 [2020-12-09 19:06:39,037 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:06:39,037 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:06:39,038 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:06:47,205 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:06:47,206 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:06:47,207 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:06:56,055 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 19:06:56,056 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:06:56,057 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:06:56,058 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:06:56,059 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-12-09 19:06:56,060 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:06:56,062 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:06:56,066 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:06:56,067 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 19:06:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:06:56,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776494720] [2020-12-09 19:06:56,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [351337037] [2020-12-09 19:06:56,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt [2020-12-09 19:06:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:06:56,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-09 19:06:56,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:06:56,257 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2020-12-09 19:06:56,258 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:56,263 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:56,264 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:06:56,264 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2020-12-09 19:06:56,305 INFO L382 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-12-09 19:06:56,305 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:56,314 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:56,314 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:06:56,315 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2020-12-09 19:06:56,358 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:56,358 INFO L382 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 18 treesize of output 46 [2020-12-09 19:06:56,359 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:56,376 INFO L625 ElimStorePlain]: treesize reduction 26, result has 43.5 percent of original size [2020-12-09 19:06:56,376 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:06:56,376 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2020-12-09 19:06:56,468 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 19:06:56,468 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2020-12-09 19:06:56,469 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:56,477 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:56,478 INFO L547 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-12-09 19:06:56,478 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2020-12-09 19:06:56,544 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:56,544 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2020-12-09 19:06:56,545 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:06:56,550 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:56,551 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:06:56,551 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2020-12-09 19:06:56,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:06:56,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:06:56,627 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2020-12-09 19:06:56,629 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:06:56,649 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:06:56,650 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:06:56,650 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2020-12-09 19:07:00,807 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:00,807 INFO L382 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 12 treesize of output 16 [2020-12-09 19:07:00,808 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:00,810 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:00,818 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:00,818 INFO L382 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 12 treesize of output 16 [2020-12-09 19:07:00,819 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:00,821 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:00,835 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:00,836 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-09 19:07:00,836 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:7 [2020-12-09 19:07:00,844 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-12-09 19:07:00,844 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:00,847 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-12-09 19:07:00,848 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:00,852 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:00,853 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-09 19:07:00,853 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2020-12-09 19:07:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:07:00,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74725909] [2020-12-09 19:07:00,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:07:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:07:00,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 19:07:00,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:07:00,918 INFO L382 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-12-09 19:07:00,918 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:00,923 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:00,924 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:07:00,924 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2020-12-09 19:07:00,946 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:00,947 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 59 [2020-12-09 19:07:00,948 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:00,956 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:00,957 INFO L547 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-12-09 19:07:00,957 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:23 [2020-12-09 19:07:00,990 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 19:07:00,990 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2020-12-09 19:07:00,991 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:01,002 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:01,003 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-09 19:07:01,003 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2020-12-09 19:07:01,022 INFO L382 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-12-09 19:07:01,023 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:01,029 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:01,030 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:07:01,030 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2020-12-09 19:07:01,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:07:01,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:07:05,273 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2020-12-09 19:07:05,275 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:07:05,298 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:05,299 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:05,299 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:07:05,301 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 19:07:05,301 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 19:07:05,302 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:42 [2020-12-09 19:07:05,303 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:05,303 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:07:05,304 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 19:07:17,908 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:07:17,909 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:17,910 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:20,128 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 19:07:20,129 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:07:20,130 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:20,130 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:20,132 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-12-09 19:07:20,133 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:20,134 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:20,139 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:20,140 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 19:07:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:07:20,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 19:07:20,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9, 8, 8, 8] total 22 [2020-12-09 19:07:20,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130617512] [2020-12-09 19:07:20,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-09 19:07:20,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:07:20,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-09 19:07:20,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=436, Unknown=4, NotChecked=0, Total=506 [2020-12-09 19:07:20,151 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 23 states. [2020-12-09 19:07:21,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:07:21,942 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2020-12-09 19:07:21,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 19:07:21,943 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 20 [2020-12-09 19:07:21,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:07:21,943 INFO L225 Difference]: With dead ends: 75 [2020-12-09 19:07:21,943 INFO L226 Difference]: Without dead ends: 75 [2020-12-09 19:07:21,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 85 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 44.6s TimeCoverageRelationStatistics Valid=236, Invalid=752, Unknown=4, NotChecked=0, Total=992 [2020-12-09 19:07:21,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-12-09 19:07:21,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 58. [2020-12-09 19:07:21,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-12-09 19:07:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2020-12-09 19:07:21,946 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 20 [2020-12-09 19:07:21,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:07:21,946 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2020-12-09 19:07:21,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-09 19:07:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2020-12-09 19:07:21,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 19:07:21,946 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:07:21,946 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:07:22,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt,13 mathsat -unsat_core_generation=3,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:07:22,548 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:07:22,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:07:22,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1388841297, now seen corresponding path program 1 times [2020-12-09 19:07:22,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:07:22,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436683993] [2020-12-09 19:07:22,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-12-09 19:07:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:07:22,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 28 conjunts are in the unsatisfiable core [2020-12-09 19:07:22,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:07:22,652 INFO L382 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-12-09 19:07:22,652 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:22,666 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:22,669 INFO L382 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-12-09 19:07:22,669 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:22,681 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:22,682 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:07:22,682 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:22 [2020-12-09 19:07:22,722 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:22,722 INFO L382 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-12-09 19:07:22,723 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:22,742 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:22,746 INFO L382 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-12-09 19:07:22,747 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:22,763 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:22,764 INFO L547 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-12-09 19:07:22,764 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:28 [2020-12-09 19:07:22,835 INFO L382 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-12-09 19:07:22,836 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:22,855 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:22,863 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 19:07:22,864 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:22,881 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:22,882 INFO L547 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-12-09 19:07:22,883 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:43 [2020-12-09 19:07:22,922 INFO L443 ElimStorePlain]: Different costs {1=[|v_#valid_75|], 3=[|v_#length_60|]} [2020-12-09 19:07:22,934 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:22,934 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2020-12-09 19:07:22,935 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:22,956 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:22,975 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:22,976 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 44 [2020-12-09 19:07:22,977 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:23,014 INFO L625 ElimStorePlain]: treesize reduction 16, result has 73.8 percent of original size [2020-12-09 19:07:23,015 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 19:07:23,016 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:45 [2020-12-09 19:07:23,120 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 19:07:23,121 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2020-12-09 19:07:23,122 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:23,142 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:23,163 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 19:07:23,163 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2020-12-09 19:07:23,164 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:23,180 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:23,182 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-09 19:07:23,182 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:52 [2020-12-09 19:07:23,265 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:23,266 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2020-12-09 19:07:23,266 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:23,288 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:23,298 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:23,298 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2020-12-09 19:07:23,299 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:23,307 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:23,308 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:07:23,308 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:66, output treesize:20 [2020-12-09 19:07:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:07:23,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:07:23,663 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:24,388 INFO L382 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 40 treesize of output 32 [2020-12-09 19:07:24,391 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-12-09 19:07:24,453 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:24,462 INFO L382 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 66 treesize of output 62 [2020-12-09 19:07:24,464 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:07:24,544 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:24,556 INFO L382 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 102 treesize of output 94 [2020-12-09 19:07:24,558 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:07:24,726 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-12-09 19:07:24,726 INFO L625 ElimStorePlain]: treesize reduction 18, result has 78.6 percent of original size [2020-12-09 19:07:24,728 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:07:24,729 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:24,731 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:24,732 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-12-09 19:07:24,733 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:80, output treesize:66 [2020-12-09 19:07:24,734 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:07:24,734 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:24,735 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:32,139 WARN L197 SmtUtils]: Spent 7.04 s on a formula simplification that was a NOOP. DAG size: 44 [2020-12-09 19:07:32,142 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:07:32,142 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:32,143 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:32,372 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:32,373 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:07:32,373 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:32,374 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:32,375 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-12-09 19:07:32,376 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:32,377 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:32,379 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:32,380 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 19:07:32,382 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:07:32,382 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:32,383 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:32,386 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:07:32,386 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:32,387 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:32,412 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:32,412 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 19:07:32,413 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:32,438 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:32,438 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 19:07:32,439 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:32,463 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:32,464 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 19:07:32,464 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:32,486 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:32,486 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 19:07:32,487 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:32,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:07:32,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:07:32,507 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 19:07:32,508 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:32,531 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:32,531 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 19:07:32,532 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:32,564 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:32,564 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 19:07:32,565 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:32,672 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-12-09 19:07:32,673 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:32,675 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 6 xjuncts. [2020-12-09 19:07:32,675 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:169, output treesize:70 [2020-12-09 19:07:34,865 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 19:07:43,537 WARN L197 SmtUtils]: Spent 4.34 s on a formula simplification that was a NOOP. DAG size: 33 [2020-12-09 19:07:45,261 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:07:45,261 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:45,262 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:47,720 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:07:47,721 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:47,722 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:48,084 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:07:48,084 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:48,085 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:07:48,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436683993] [2020-12-09 19:07:48,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1527980557] [2020-12-09 19:07:48,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt [2020-12-09 19:07:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:07:48,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 28 conjunts are in the unsatisfiable core [2020-12-09 19:07:48,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:07:48,717 INFO L382 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-12-09 19:07:48,718 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:48,742 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:48,747 INFO L382 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-12-09 19:07:48,748 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:48,772 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:48,772 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:07:48,773 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:25 [2020-12-09 19:07:48,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:07:48,880 INFO L382 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-12-09 19:07:48,881 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:48,911 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:48,928 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:48,929 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 19:07:48,930 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:48,958 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:48,959 INFO L547 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-12-09 19:07:48,959 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2020-12-09 19:07:49,206 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 19:07:49,207 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:49,248 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:49,257 INFO L382 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-12-09 19:07:49,258 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:49,287 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:49,288 INFO L547 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-12-09 19:07:49,288 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:46 [2020-12-09 19:07:49,443 INFO L443 ElimStorePlain]: Different costs {1=[|v_#valid_81|], 3=[|v_#length_66|]} [2020-12-09 19:07:49,467 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:49,467 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2020-12-09 19:07:49,468 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:49,508 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:49,549 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:49,549 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 42 [2020-12-09 19:07:49,551 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:49,634 INFO L625 ElimStorePlain]: treesize reduction 16, result has 75.0 percent of original size [2020-12-09 19:07:49,635 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 19:07:49,635 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:48 [2020-12-09 19:07:49,936 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 19:07:49,937 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2020-12-09 19:07:49,938 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:49,972 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:50,014 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 19:07:50,014 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2020-12-09 19:07:50,015 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:50,046 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:50,048 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 19:07:50,048 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:52 [2020-12-09 19:07:50,221 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:50,222 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2020-12-09 19:07:50,223 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:50,252 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:50,272 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:50,272 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2020-12-09 19:07:50,273 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:50,293 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:50,294 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:07:50,294 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:66, output treesize:18 [2020-12-09 19:07:50,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:07:50,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:07:50,355 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:51,074 INFO L382 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 40 treesize of output 32 [2020-12-09 19:07:51,078 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-12-09 19:07:51,163 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:51,177 INFO L382 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 66 treesize of output 62 [2020-12-09 19:07:51,178 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:07:51,289 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-12-09 19:07:51,290 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:51,305 INFO L382 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 102 treesize of output 94 [2020-12-09 19:07:51,307 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:07:51,538 WARN L197 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-12-09 19:07:51,538 INFO L625 ElimStorePlain]: treesize reduction 18, result has 78.6 percent of original size [2020-12-09 19:07:51,540 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:51,540 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 19:07:51,541 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:07:51,542 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-12-09 19:07:51,542 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:80, output treesize:66 [2020-12-09 19:07:51,543 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:51,543 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 19:07:51,544 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:07:52,279 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:07:52,280 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:52,281 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:52,674 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:52,675 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:07:52,675 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:52,676 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:52,679 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-12-09 19:07:52,680 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:52,681 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:52,682 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:52,683 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 19:07:52,685 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:07:52,685 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:52,686 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:52,687 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:07:52,687 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:07:52,688 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:07:52,725 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:52,725 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 19:07:52,726 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:52,760 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:52,760 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 19:07:52,761 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:52,796 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:52,796 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 19:07:52,797 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:52,834 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:52,834 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 19:07:52,835 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:52,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:07:52,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:07:52,858 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 19:07:52,858 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:52,888 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:52,888 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 19:07:52,889 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:52,927 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:52,928 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 19:07:52,929 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-12-09 19:07:53,085 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-12-09 19:07:53,085 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:07:53,087 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 6 xjuncts. [2020-12-09 19:07:53,088 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:169, output treesize:70 [2020-12-09 19:07:55,273 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 19:08:07,935 WARN L197 SmtUtils]: Spent 4.30 s on a formula simplification that was a NOOP. DAG size: 33 [2020-12-09 19:08:28,809 WARN L197 SmtUtils]: Spent 8.31 s on a formula simplification that was a NOOP. DAG size: 47 [2020-12-09 19:08:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:08:28,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640920787] [2020-12-09 19:08:28,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:08:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:08:28,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-09 19:08:28,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:08:29,110 INFO L382 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-12-09 19:08:29,111 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:29,134 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:29,139 INFO L382 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-12-09 19:08:29,140 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:29,159 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:29,160 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:08:29,160 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2020-12-09 19:08:29,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:08:29,305 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2020-12-09 19:08:29,306 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:29,328 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:29,346 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:29,347 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2020-12-09 19:08:29,347 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:29,367 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:29,368 INFO L547 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-12-09 19:08:29,368 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2020-12-09 19:08:29,714 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 19:08:29,714 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2020-12-09 19:08:29,715 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:29,750 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:29,788 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 19:08:29,789 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2020-12-09 19:08:29,789 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:29,820 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:29,822 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-09 19:08:29,822 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:48 [2020-12-09 19:08:30,019 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:30,020 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2020-12-09 19:08:30,021 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:30,051 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:30,070 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:30,070 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2020-12-09 19:08:30,071 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:30,089 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:30,090 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:08:30,090 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:62, output treesize:18 [2020-12-09 19:08:30,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:08:30,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:08:30,241 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:31,434 INFO L382 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 40 treesize of output 32 [2020-12-09 19:08:31,437 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-12-09 19:08:31,525 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:31,541 INFO L382 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 66 treesize of output 62 [2020-12-09 19:08:31,542 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:08:31,687 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-12-09 19:08:31,688 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:31,705 INFO L382 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 102 treesize of output 94 [2020-12-09 19:08:31,708 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 19:08:31,963 WARN L197 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-12-09 19:08:31,963 INFO L625 ElimStorePlain]: treesize reduction 18, result has 78.6 percent of original size [2020-12-09 19:08:31,965 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:31,965 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 19:08:31,966 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:08:31,967 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-12-09 19:08:31,967 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:80, output treesize:66 [2020-12-09 19:08:31,968 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:31,968 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 19:08:31,969 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:08:34,717 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:08:34,717 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:34,718 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:35,495 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:35,496 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:08:35,496 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:35,497 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:35,498 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:08:35,498 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:35,499 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:35,500 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-12-09 19:08:35,503 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:35,504 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:35,504 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 19:08:35,506 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:35,507 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:35,508 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:35,510 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:08:35,510 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:35,511 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:35,512 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:08:35,512 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:35,513 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:35,514 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:35,515 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:08:35,515 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:35,516 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:35,517 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-12-09 19:08:35,517 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:35,518 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:35,520 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:35,521 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 19:08:35,523 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:08:35,523 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:35,524 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:35,525 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:08:35,525 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:35,526 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:35,527 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:35,528 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:08:35,528 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:35,529 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:35,530 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:08:35,531 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:35,531 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:35,532 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:08:35,533 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-12-09 19:08:35,534 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:35,535 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:35,536 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-12-09 19:08:35,539 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:35,540 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:35,540 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 19:08:35,543 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:08:35,543 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:35,546 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:35,547 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:08:35,547 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 19:08:35,548 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:35,552 INFO L443 ElimStorePlain]: Different costs {3=[|#valid|], 5=[|#length|]} [2020-12-09 19:08:35,585 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:35,585 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 19:08:35,586 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:35,625 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:35,625 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 19:08:35,626 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:35,659 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:35,660 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 19:08:35,660 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:35,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:08:35,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:08:35,712 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 19:08:35,713 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:35,743 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:35,744 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 19:08:35,744 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:35,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:08:35,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 19:08:35,786 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 19:08:35,787 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:35,811 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:35,811 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 19:08:35,812 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:35,978 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-12-09 19:08:35,978 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:36,018 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:36,018 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2020-12-09 19:08:36,019 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:36,020 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:36,021 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 19:08:36,022 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:36,061 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:36,062 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2020-12-09 19:08:36,063 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:36,063 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:36,064 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 19:08:36,065 INFO L547 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:36,077 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2020-12-09 19:08:36,079 INFO L547 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:36,099 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2020-12-09 19:08:36,100 INFO L547 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:36,111 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2020-12-09 19:08:36,112 INFO L547 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:36,452 WARN L197 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2020-12-09 19:08:36,452 INFO L625 ElimStorePlain]: treesize reduction 8, result has 92.0 percent of original size [2020-12-09 19:08:36,454 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:36,455 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:08:36,457 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2020-12-09 19:08:36,457 INFO L244 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:225, output treesize:14 [2020-12-09 19:08:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:08:36,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 19:08:36,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10, 10, 8, 8] total 35 [2020-12-09 19:08:36,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900133713] [2020-12-09 19:08:36,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-12-09 19:08:36,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:08:36,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-12-09 19:08:36,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1080, Unknown=13, NotChecked=0, Total=1260 [2020-12-09 19:08:36,624 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 36 states. [2020-12-09 19:08:37,410 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2020-12-09 19:08:37,674 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2020-12-09 19:08:40,078 WARN L197 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2020-12-09 19:08:43,168 WARN L197 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2020-12-09 19:08:45,540 WARN L197 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2020-12-09 19:08:45,882 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-12-09 19:08:46,096 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2020-12-09 19:08:49,178 WARN L197 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2020-12-09 19:08:49,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:08:49,531 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2020-12-09 19:08:49,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 19:08:49,532 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 20 [2020-12-09 19:08:49,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:08:49,533 INFO L225 Difference]: With dead ends: 77 [2020-12-09 19:08:49,533 INFO L226 Difference]: Without dead ends: 77 [2020-12-09 19:08:49,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 64 SyntacticMatches, 16 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 79.2s TimeCoverageRelationStatistics Valid=389, Invalid=1490, Unknown=13, NotChecked=0, Total=1892 [2020-12-09 19:08:49,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-12-09 19:08:49,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2020-12-09 19:08:49,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-12-09 19:08:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2020-12-09 19:08:49,535 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 20 [2020-12-09 19:08:49,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:08:49,536 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2020-12-09 19:08:49,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-12-09 19:08:49,536 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2020-12-09 19:08:49,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 19:08:49,536 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:08:49,536 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:08:50,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 cvc4 --incremental --print-success --lang smt [2020-12-09 19:08:50,139 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:08:50,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:08:50,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1096314169, now seen corresponding path program 1 times [2020-12-09 19:08:50,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:08:50,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [946972113] [2020-12-09 19:08:50,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2020-12-09 19:08:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:08:50,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 19:08:50,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:08:50,250 INFO L382 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-12-09 19:08:50,250 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:50,259 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:50,260 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:08:50,260 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2020-12-09 19:08:50,280 INFO L382 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-12-09 19:08:50,281 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:50,284 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:50,284 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:08:50,285 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2020-12-09 19:08:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:08:50,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:08:50,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [946972113] [2020-12-09 19:08:50,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:08:50,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 19:08:50,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258560756] [2020-12-09 19:08:50,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 19:08:50,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:08:50,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 19:08:50,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:08:50,304 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 6 states. [2020-12-09 19:08:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:08:50,753 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2020-12-09 19:08:50,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 19:08:50,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-09 19:08:50,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:08:50,755 INFO L225 Difference]: With dead ends: 56 [2020-12-09 19:08:50,755 INFO L226 Difference]: Without dead ends: 56 [2020-12-09 19:08:50,755 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 19:08:50,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-12-09 19:08:50,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-12-09 19:08:50,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 19:08:50,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2020-12-09 19:08:50,756 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 21 [2020-12-09 19:08:50,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:08:50,757 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2020-12-09 19:08:50,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 19:08:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2020-12-09 19:08:50,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 19:08:50,757 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:08:50,757 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:08:50,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2020-12-09 19:08:50,959 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:08:50,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:08:50,960 INFO L82 PathProgramCache]: Analyzing trace with hash -373999028, now seen corresponding path program 1 times [2020-12-09 19:08:50,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:08:50,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331054536] [2020-12-09 19:08:50,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/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-12-09 19:08:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:08:51,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 19:08:51,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:08:51,089 INFO L382 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-12-09 19:08:51,090 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:51,093 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:51,093 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:08:51,093 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 19:08:51,115 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:51,115 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 19:08:51,116 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:51,130 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:51,131 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:08:51,131 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2020-12-09 19:08:51,170 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 19:08:51,170 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:51,185 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:51,185 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:08:51,185 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2020-12-09 19:08:51,214 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2020-12-09 19:08:51,214 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:51,226 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 19:08:51,227 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 19:08:51,227 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:10 [2020-12-09 19:08:51,258 INFO L382 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-12-09 19:08:51,259 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 19:08:51,280 INFO L625 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2020-12-09 19:08:51,281 INFO L547 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-12-09 19:08:51,281 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2020-12-09 19:08:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:08:51,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:08:51,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331054536] [2020-12-09 19:08:51,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:08:51,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 19:08:51,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66273789] [2020-12-09 19:08:51,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 19:08:51,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:08:51,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 19:08:51,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 19:08:51,312 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 7 states. [2020-12-09 19:09:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:09:05,820 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2020-12-09 19:09:05,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 19:09:05,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-12-09 19:09:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:09:05,821 INFO L225 Difference]: With dead ends: 71 [2020-12-09 19:09:05,821 INFO L226 Difference]: Without dead ends: 71 [2020-12-09 19:09:05,821 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-12-09 19:09:05,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-09 19:09:05,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 55. [2020-12-09 19:09:05,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-12-09 19:09:05,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2020-12-09 19:09:05,823 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 22 [2020-12-09 19:09:05,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:09:05,823 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2020-12-09 19:09:05,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 19:09:05,823 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-12-09 19:09:05,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 19:09:05,823 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:09:05,823 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:09:06,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2020-12-09 19:09:06,024 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:09:06,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:09:06,026 INFO L82 PathProgramCache]: Analyzing trace with hash -373999027, now seen corresponding path program 1 times [2020-12-09 19:09:06,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:09:06,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961238868] [2020-12-09 19:09:06,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2020-12-09 19:09:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:09:06,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 19:09:06,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:09:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:09:06,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:09:06,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961238868] [2020-12-09 19:09:06,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:09:06,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:09:06,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992411574] [2020-12-09 19:09:06,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:09:06,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:09:06,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:09:06,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:09:06,257 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 4 states. [2020-12-09 19:09:06,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:09:06,376 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2020-12-09 19:09:06,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:09:06,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-12-09 19:09:06,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:09:06,378 INFO L225 Difference]: With dead ends: 50 [2020-12-09 19:09:06,378 INFO L226 Difference]: Without dead ends: 50 [2020-12-09 19:09:06,378 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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-12-09 19:09:06,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-12-09 19:09:06,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-12-09 19:09:06,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-12-09 19:09:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2020-12-09 19:09:06,379 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 22 [2020-12-09 19:09:06,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:09:06,379 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2020-12-09 19:09:06,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:09:06,379 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2020-12-09 19:09:06,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-09 19:09:06,380 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:09:06,380 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:09:06,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2020-12-09 19:09:06,581 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-12-09 19:09:06,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:09:06,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1020122834, now seen corresponding path program 1 times [2020-12-09 19:09:06,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:09:06,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188529562] [2020-12-09 19:09:06,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c918000f-8927-46b5-963f-4d905575f8d5/bin/utaipan/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2020-12-09 19:09:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 19:09:06,733 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 19:09:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 19:09:06,811 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 19:09:06,844 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-12-09 19:09:06,844 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 19:09:07,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2020-12-09 19:09:07,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:09:07 BoogieIcfgContainer [2020-12-09 19:09:07,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 19:09:07,075 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 19:09:07,075 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 19:09:07,075 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 19:09:07,076 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:06:27" (3/4) ... [2020-12-09 19:09:07,078 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-09 19:09:07,078 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 19:09:07,078 INFO L168 Benchmark]: Toolchain (without parser) took 160410.67 ms. Allocated memory was 58.7 MB in the beginning and 86.0 MB in the end (delta: 27.3 MB). Free memory was 35.8 MB in the beginning and 48.3 MB in the end (delta: -12.5 MB). Peak memory consumption was 15.0 MB. Max. memory is 16.1 GB. [2020-12-09 19:09:07,079 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 58.7 MB. Free memory was 40.6 MB in the beginning and 40.5 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 19:09:07,079 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.68 ms. Allocated memory is still 58.7 MB. Free memory was 35.6 MB in the beginning and 28.2 MB in the end (delta: 7.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 19:09:07,079 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.60 ms. Allocated memory is still 58.7 MB. Free memory was 28.1 MB in the beginning and 26.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 19:09:07,079 INFO L168 Benchmark]: Boogie Preprocessor took 28.54 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 26.1 MB in the beginning and 53.1 MB in the end (delta: -27.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.1 GB. [2020-12-09 19:09:07,079 INFO L168 Benchmark]: RCFGBuilder took 501.57 ms. Allocated memory is still 71.3 MB. Free memory was 53.1 MB in the beginning and 41.9 MB in the end (delta: 11.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-12-09 19:09:07,080 INFO L168 Benchmark]: TraceAbstraction took 159505.58 ms. Allocated memory was 71.3 MB in the beginning and 86.0 MB in the end (delta: 14.7 MB). Free memory was 41.6 MB in the beginning and 49.1 MB in the end (delta: -7.6 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. [2020-12-09 19:09:07,080 INFO L168 Benchmark]: Witness Printer took 2.66 ms. Allocated memory is still 86.0 MB. Free memory was 49.1 MB in the beginning and 48.3 MB in the end (delta: 816.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 19:09:07,081 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.11 ms. Allocated memory is still 58.7 MB. Free memory was 40.6 MB in the beginning and 40.5 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 332.68 ms. Allocated memory is still 58.7 MB. Free memory was 35.6 MB in the beginning and 28.2 MB in the end (delta: 7.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 34.60 ms. Allocated memory is still 58.7 MB. Free memory was 28.1 MB in the beginning and 26.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.54 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 26.1 MB in the beginning and 53.1 MB in the end (delta: -27.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.1 GB. * RCFGBuilder took 501.57 ms. Allocated memory is still 71.3 MB. Free memory was 53.1 MB in the beginning and 41.9 MB in the end (delta: 11.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 159505.58 ms. Allocated memory was 71.3 MB in the beginning and 86.0 MB in the end (delta: 14.7 MB). Free memory was 41.6 MB in the beginning and 49.1 MB in the end (delta: -7.6 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. * Witness Printer took 2.66 ms. Allocated memory is still 86.0 MB. Free memory was 49.1 MB in the beginning and 48.3 MB in the end (delta: 816.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 537]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 537. Possible FailurePath: [L539] struct item *list = ((void *)0); [L530] struct item *item = malloc(sizeof *item); [L531] EXPR \read(**plist) [L531] item->next = *plist [L532] EXPR item->next [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L532-L534] item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L535] *plist = item [L542] COND FALSE !(__VERIFIER_nondet_int()) [L543] \read(*list) [L543] COND TRUE \read(*list) [L544] EXPR \read(*list) [L544] EXPR list->next [L544] struct item *next = list->next; [L545] EXPR \read(*list) [L545] free(list) [L545] free(list) [L545] free(list) [L546] list = next [L548] \read(*list) [L548] COND FALSE !(\read(*list)) [L553] return 0; [L539] struct item *list = ((void *)0); [L553] return 0; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 80 locations, 41 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 159.4s, OverallIterations: 17, TraceHistogramMax: 2, AutomataDifference: 32.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 519 SDtfs, 2032 SDslu, 1052 SDs, 0 SdLazy, 2199 SolverSat, 199 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 20.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 453 GetRequests, 284 SyntacticMatches, 24 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 125.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 245 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 120.0s InterpolantComputationTime, 339 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 407 ConstructedInterpolants, 98 QuantifiedInterpolants, 128041 SizeOfPredicates, 244 NumberOfNonLiveVariables, 1946 ConjunctsInSsa, 248 ConjunctsInUnsatCore, 26 InterpolantComputations, 14 PerfectInterpolantSequences, 12/72 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...