./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-bftpd/bftpd_2.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_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/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 129dca108ba5ab1702fbcd782a34bbf933adb446 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/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 129dca108ba5ab1702fbcd782a34bbf933adb446 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalStateException: Tracecheck IpTcStrategyModuleMathsat [546478603] said UNSAT, interpolant generator IpTcStrategyModuleZ3 [520307238] failed with TRACE_FEASIBLE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 10:15:47,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 10:15:47,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 10:15:47,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 10:15:47,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 10:15:47,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 10:15:47,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 10:15:47,366 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 10:15:47,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 10:15:47,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 10:15:47,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 10:15:47,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 10:15:47,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 10:15:47,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 10:15:47,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 10:15:47,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 10:15:47,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 10:15:47,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 10:15:47,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 10:15:47,378 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 10:15:47,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 10:15:47,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 10:15:47,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 10:15:47,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 10:15:47,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 10:15:47,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 10:15:47,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 10:15:47,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 10:15:47,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 10:15:47,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 10:15:47,388 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 10:15:47,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 10:15:47,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 10:15:47,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 10:15:47,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 10:15:47,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 10:15:47,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 10:15:47,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 10:15:47,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 10:15:47,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 10:15:47,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 10:15:47,394 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-12-09 10:15:47,410 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 10:15:47,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 10:15:47,411 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 10:15:47,411 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 10:15:47,411 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 10:15:47,411 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 10:15:47,411 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 10:15:47,412 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 10:15:47,412 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 10:15:47,412 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 10:15:47,412 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 10:15:47,412 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 10:15:47,412 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 10:15:47,412 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 10:15:47,412 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 10:15:47,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 10:15:47,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 10:15:47,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 10:15:47,413 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 10:15:47,413 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 10:15:47,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 10:15:47,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 10:15:47,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 10:15:47,414 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 10:15:47,414 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 10:15:47,414 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 10:15:47,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 10:15:47,414 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 10:15:47,414 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 10:15:47,414 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 10:15:47,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 10:15:47,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 10:15:47,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 10:15:47,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 10:15:47,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 10:15:47,415 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 10:15:47,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 10:15:47,415 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 10:15:47,415 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 10:15:47,415 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_14d6165d-9497-4f75-8499-36acc3fe1f90/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_14d6165d-9497-4f75-8499-36acc3fe1f90/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 -> 129dca108ba5ab1702fbcd782a34bbf933adb446 [2020-12-09 10:15:47,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 10:15:47,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 10:15:47,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 10:15:47,623 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 10:15:47,623 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 10:15:47,624 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/../../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2020-12-09 10:15:47,666 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/data/1b380504f/d62d44c268db415bb42084ce8ae217f3/FLAGf735b3e68 [2020-12-09 10:15:48,077 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 10:15:48,077 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2020-12-09 10:15:48,087 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/data/1b380504f/d62d44c268db415bb42084ce8ae217f3/FLAGf735b3e68 [2020-12-09 10:15:48,100 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/data/1b380504f/d62d44c268db415bb42084ce8ae217f3 [2020-12-09 10:15:48,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 10:15:48,103 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 10:15:48,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 10:15:48,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 10:15:48,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 10:15:48,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:15:48" (1/1) ... [2020-12-09 10:15:48,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ab368e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:15:48, skipping insertion in model container [2020-12-09 10:15:48,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:15:48" (1/1) ... [2020-12-09 10:15:48,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 10:15:48,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 10:15:48,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 10:15:48,366 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 10:15:48,396 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 10:15:48,445 INFO L208 MainTranslator]: Completed translation [2020-12-09 10:15:48,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:15:48 WrapperNode [2020-12-09 10:15:48,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 10:15:48,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 10:15:48,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 10:15:48,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 10:15:48,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:15:48" (1/1) ... [2020-12-09 10:15:48,463 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:15:48" (1/1) ... [2020-12-09 10:15:48,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 10:15:48,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 10:15:48,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 10:15:48,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 10:15:48,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:15:48" (1/1) ... [2020-12-09 10:15:48,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:15:48" (1/1) ... [2020-12-09 10:15:48,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:15:48" (1/1) ... [2020-12-09 10:15:48,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:15:48" (1/1) ... [2020-12-09 10:15:48,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:15:48" (1/1) ... [2020-12-09 10:15:48,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:15:48" (1/1) ... [2020-12-09 10:15:48,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:15:48" (1/1) ... [2020-12-09 10:15:48,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 10:15:48,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 10:15:48,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 10:15:48,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 10:15:48,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:15:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/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 10:15:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-09 10:15:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 10:15:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 10:15:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 10:15:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 10:15:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-09 10:15:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 10:15:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 10:15:48,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 10:15:49,081 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 10:15:49,081 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2020-12-09 10:15:49,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:15:49 BoogieIcfgContainer [2020-12-09 10:15:49,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 10:15:49,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 10:15:49,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 10:15:49,087 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 10:15:49,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 10:15:48" (1/3) ... [2020-12-09 10:15:49,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d04efa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:15:49, skipping insertion in model container [2020-12-09 10:15:49,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:15:48" (2/3) ... [2020-12-09 10:15:49,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d04efa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:15:49, skipping insertion in model container [2020-12-09 10:15:49,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:15:49" (3/3) ... [2020-12-09 10:15:49,089 INFO L111 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2020-12-09 10:15:49,099 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 10:15:49,101 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 58 error locations. [2020-12-09 10:15:49,109 INFO L253 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2020-12-09 10:15:49,122 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 10:15:49,123 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 10:15:49,123 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 10:15:49,123 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 10:15:49,123 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 10:15:49,123 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 10:15:49,123 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 10:15:49,123 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 10:15:49,136 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2020-12-09 10:15:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 10:15:49,140 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:15:49,141 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 10:15:49,141 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:15:49,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:15:49,145 INFO L82 PathProgramCache]: Analyzing trace with hash 287661, now seen corresponding path program 1 times [2020-12-09 10:15:49,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:15:49,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974206403] [2020-12-09 10:15:49,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:15:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:15:49,280 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 10:15:49,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974206403] [2020-12-09 10:15:49,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:15:49,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 10:15:49,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64477128] [2020-12-09 10:15:49,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 10:15:49,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:15:49,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 10:15:49,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 10:15:49,295 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 3 states. [2020-12-09 10:15:49,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:15:49,393 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2020-12-09 10:15:49,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 10:15:49,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-09 10:15:49,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:15:49,404 INFO L225 Difference]: With dead ends: 153 [2020-12-09 10:15:49,404 INFO L226 Difference]: Without dead ends: 151 [2020-12-09 10:15:49,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 10:15:49,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-12-09 10:15:49,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2020-12-09 10:15:49,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-12-09 10:15:49,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2020-12-09 10:15:49,436 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 3 [2020-12-09 10:15:49,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:15:49,436 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2020-12-09 10:15:49,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 10:15:49,436 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2020-12-09 10:15:49,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 10:15:49,437 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:15:49,437 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 10:15:49,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 10:15:49,437 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:15:49,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:15:49,438 INFO L82 PathProgramCache]: Analyzing trace with hash 287662, now seen corresponding path program 1 times [2020-12-09 10:15:49,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:15:49,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419322730] [2020-12-09 10:15:49,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:15:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:15:49,493 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 10:15:49,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419322730] [2020-12-09 10:15:49,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:15:49,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 10:15:49,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706383342] [2020-12-09 10:15:49,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 10:15:49,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:15:49,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 10:15:49,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 10:15:49,496 INFO L87 Difference]: Start difference. First operand 144 states and 168 transitions. Second operand 3 states. [2020-12-09 10:15:49,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:15:49,606 INFO L93 Difference]: Finished difference Result 249 states and 284 transitions. [2020-12-09 10:15:49,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 10:15:49,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-09 10:15:49,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:15:49,609 INFO L225 Difference]: With dead ends: 249 [2020-12-09 10:15:49,609 INFO L226 Difference]: Without dead ends: 249 [2020-12-09 10:15:49,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 10:15:49,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-12-09 10:15:49,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 202. [2020-12-09 10:15:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-12-09 10:15:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 262 transitions. [2020-12-09 10:15:49,626 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 262 transitions. Word has length 3 [2020-12-09 10:15:49,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:15:49,626 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 262 transitions. [2020-12-09 10:15:49,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 10:15:49,626 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 262 transitions. [2020-12-09 10:15:49,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 10:15:49,627 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:15:49,627 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 10:15:49,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 10:15:49,627 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:15:49,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:15:49,627 INFO L82 PathProgramCache]: Analyzing trace with hash 8917474, now seen corresponding path program 1 times [2020-12-09 10:15:49,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:15:49,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402281677] [2020-12-09 10:15:49,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:15:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:15:49,739 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 10:15:49,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402281677] [2020-12-09 10:15:49,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:15:49,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 10:15:49,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814223993] [2020-12-09 10:15:49,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:15:49,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:15:49,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:15:49,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:15:49,741 INFO L87 Difference]: Start difference. First operand 202 states and 262 transitions. Second operand 4 states. [2020-12-09 10:15:49,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:15:49,965 INFO L93 Difference]: Finished difference Result 319 states and 400 transitions. [2020-12-09 10:15:49,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 10:15:49,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-12-09 10:15:49,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:15:49,968 INFO L225 Difference]: With dead ends: 319 [2020-12-09 10:15:49,968 INFO L226 Difference]: Without dead ends: 319 [2020-12-09 10:15:49,968 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 10:15:49,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-12-09 10:15:49,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 242. [2020-12-09 10:15:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-12-09 10:15:49,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 323 transitions. [2020-12-09 10:15:49,986 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 323 transitions. Word has length 4 [2020-12-09 10:15:49,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:15:49,986 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 323 transitions. [2020-12-09 10:15:49,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:15:49,986 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 323 transitions. [2020-12-09 10:15:49,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 10:15:49,987 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:15:49,987 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 10:15:49,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 10:15:49,987 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:15:49,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:15:49,988 INFO L82 PathProgramCache]: Analyzing trace with hash 276441741, now seen corresponding path program 1 times [2020-12-09 10:15:49,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:15:49,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605246789] [2020-12-09 10:15:49,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:15:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:15:50,110 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 10:15:50,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605246789] [2020-12-09 10:15:50,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:15:50,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 10:15:50,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656812398] [2020-12-09 10:15:50,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:15:50,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:15:50,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:15:50,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:15:50,112 INFO L87 Difference]: Start difference. First operand 242 states and 323 transitions. Second operand 4 states. [2020-12-09 10:15:50,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:15:50,281 INFO L93 Difference]: Finished difference Result 285 states and 341 transitions. [2020-12-09 10:15:50,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:15:50,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-12-09 10:15:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:15:50,283 INFO L225 Difference]: With dead ends: 285 [2020-12-09 10:15:50,283 INFO L226 Difference]: Without dead ends: 285 [2020-12-09 10:15:50,283 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 10:15:50,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-12-09 10:15:50,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 242. [2020-12-09 10:15:50,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-12-09 10:15:50,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 319 transitions. [2020-12-09 10:15:50,292 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 319 transitions. Word has length 5 [2020-12-09 10:15:50,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:15:50,292 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 319 transitions. [2020-12-09 10:15:50,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:15:50,292 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 319 transitions. [2020-12-09 10:15:50,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 10:15:50,292 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:15:50,292 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 10:15:50,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 10:15:50,293 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:15:50,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:15:50,293 INFO L82 PathProgramCache]: Analyzing trace with hash -20240572, now seen corresponding path program 1 times [2020-12-09 10:15:50,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:15:50,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107304304] [2020-12-09 10:15:50,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:15:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:15:50,324 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 10:15:50,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107304304] [2020-12-09 10:15:50,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:15:50,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 10:15:50,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622412187] [2020-12-09 10:15:50,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:15:50,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:15:50,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:15:50,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:15:50,326 INFO L87 Difference]: Start difference. First operand 242 states and 319 transitions. Second operand 4 states. [2020-12-09 10:15:50,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:15:50,394 INFO L93 Difference]: Finished difference Result 263 states and 340 transitions. [2020-12-09 10:15:50,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 10:15:50,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-12-09 10:15:50,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:15:50,397 INFO L225 Difference]: With dead ends: 263 [2020-12-09 10:15:50,397 INFO L226 Difference]: Without dead ends: 263 [2020-12-09 10:15:50,397 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 10:15:50,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2020-12-09 10:15:50,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 251. [2020-12-09 10:15:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2020-12-09 10:15:50,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 335 transitions. [2020-12-09 10:15:50,406 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 335 transitions. Word has length 6 [2020-12-09 10:15:50,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:15:50,406 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 335 transitions. [2020-12-09 10:15:50,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:15:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 335 transitions. [2020-12-09 10:15:50,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 10:15:50,406 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:15:50,406 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:15:50,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 10:15:50,407 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:15:50,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:15:50,408 INFO L82 PathProgramCache]: Analyzing trace with hash -627457681, now seen corresponding path program 1 times [2020-12-09 10:15:50,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:15:50,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833398701] [2020-12-09 10:15:50,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:15:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:15:50,459 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 10:15:50,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833398701] [2020-12-09 10:15:50,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:15:50,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 10:15:50,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238113577] [2020-12-09 10:15:50,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 10:15:50,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:15:50,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 10:15:50,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 10:15:50,461 INFO L87 Difference]: Start difference. First operand 251 states and 335 transitions. Second operand 3 states. [2020-12-09 10:15:50,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:15:50,508 INFO L93 Difference]: Finished difference Result 254 states and 337 transitions. [2020-12-09 10:15:50,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 10:15:50,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-09 10:15:50,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:15:50,510 INFO L225 Difference]: With dead ends: 254 [2020-12-09 10:15:50,510 INFO L226 Difference]: Without dead ends: 254 [2020-12-09 10:15:50,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 10:15:50,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-12-09 10:15:50,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2020-12-09 10:15:50,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-09 10:15:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 333 transitions. [2020-12-09 10:15:50,517 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 333 transitions. Word has length 7 [2020-12-09 10:15:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:15:50,517 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 333 transitions. [2020-12-09 10:15:50,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 10:15:50,518 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 333 transitions. [2020-12-09 10:15:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 10:15:50,518 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:15:50,518 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:15:50,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 10:15:50,519 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:15:50,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:15:50,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1943894891, now seen corresponding path program 1 times [2020-12-09 10:15:50,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:15:50,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521702241] [2020-12-09 10:15:50,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:15:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:15:50,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:15:50,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521702241] [2020-12-09 10:15:50,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061877715] [2020-12-09 10:15:50,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/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 10:15:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:15:50,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 10:15:50,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:15:50,832 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-12-09 10:15:50,833 INFO L348 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2020-12-09 10:15:50,833 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 21 treesize of output 101 [2020-12-09 10:15:50,838 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 10:15:50,899 INFO L625 ElimStorePlain]: treesize reduction 50, result has 53.3 percent of original size [2020-12-09 10:15:50,906 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 10:15:50,906 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:28, output treesize:12 [2020-12-09 10:15:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:15:50,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 10:15:50,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:15:50,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [556446765] [2020-12-09 10:15:50,982 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 10:15:50,982 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 10:15:50,985 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 10:15:50,988 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 10:15:50,989 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 10:15:51,049 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:15:51,061 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:15:51,073 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:15:51,777 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 10:15:51,949 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-12-09 10:15:53,710 WARN L197 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 257 DAG size of output: 197 [2020-12-09 10:15:55,503 WARN L197 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 267 DAG size of output: 204 [2020-12-09 10:15:56,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 10:15:56,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 2, 2] total 9 [2020-12-09 10:15:56,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903443027] [2020-12-09 10:15:56,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:15:56,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:15:56,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:15:56,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-12-09 10:15:56,022 INFO L87 Difference]: Start difference. First operand 250 states and 333 transitions. Second operand 5 states. [2020-12-09 10:15:56,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:15:56,474 INFO L93 Difference]: Finished difference Result 264 states and 338 transitions. [2020-12-09 10:15:56,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 10:15:56,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-12-09 10:15:56,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:15:56,476 INFO L225 Difference]: With dead ends: 264 [2020-12-09 10:15:56,477 INFO L226 Difference]: Without dead ends: 264 [2020-12-09 10:15:56,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-12-09 10:15:56,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2020-12-09 10:15:56,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 239. [2020-12-09 10:15:56,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-12-09 10:15:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 328 transitions. [2020-12-09 10:15:56,484 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 328 transitions. Word has length 11 [2020-12-09 10:15:56,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:15:56,485 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 328 transitions. [2020-12-09 10:15:56,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:15:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 328 transitions. [2020-12-09 10:15:56,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 10:15:56,485 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:15:56,485 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:15:56,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-09 10:15:56,688 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:15:56,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:15:56,689 INFO L82 PathProgramCache]: Analyzing trace with hash 235754267, now seen corresponding path program 1 times [2020-12-09 10:15:56,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:15:56,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270764094] [2020-12-09 10:15:56,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:15:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:15:56,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:15:56,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270764094] [2020-12-09 10:15:56,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822371311] [2020-12-09 10:15:56,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/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 10:15:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:15:56,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 10:15:56,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:15:56,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:15:56,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 10:15:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:15:56,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1674004491] [2020-12-09 10:15:56,827 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2020-12-09 10:15:56,827 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 10:15:56,828 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 10:15:56,828 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 10:15:56,828 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 10:15:56,861 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:15:56,880 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:15:56,892 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:15:57,706 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 10:15:57,909 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-12-09 10:15:58,048 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2020-12-09 10:15:58,227 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2020-12-09 10:15:58,421 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2020-12-09 10:15:58,631 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2020-12-09 10:15:59,045 WARN L197 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 83 [2020-12-09 10:16:01,051 WARN L197 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 265 DAG size of output: 203 [2020-12-09 10:16:03,046 WARN L197 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 260 DAG size of output: 199 [2020-12-09 10:16:03,184 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2020-12-09 10:16:03,269 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 10:16:03,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 10:16:03,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2020-12-09 10:16:03,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691207076] [2020-12-09 10:16:03,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:16:03,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:03,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:16:03,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2020-12-09 10:16:03,270 INFO L87 Difference]: Start difference. First operand 239 states and 328 transitions. Second operand 5 states. [2020-12-09 10:16:03,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:03,335 INFO L93 Difference]: Finished difference Result 327 states and 415 transitions. [2020-12-09 10:16:03,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:16:03,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-09 10:16:03,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:03,337 INFO L225 Difference]: With dead ends: 327 [2020-12-09 10:16:03,337 INFO L226 Difference]: Without dead ends: 327 [2020-12-09 10:16:03,337 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2020-12-09 10:16:03,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-12-09 10:16:03,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 253. [2020-12-09 10:16:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-12-09 10:16:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 345 transitions. [2020-12-09 10:16:03,343 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 345 transitions. Word has length 13 [2020-12-09 10:16:03,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:03,343 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 345 transitions. [2020-12-09 10:16:03,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:16:03,343 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 345 transitions. [2020-12-09 10:16:03,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 10:16:03,344 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:03,344 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 10:16:03,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 10:16:03,547 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:16:03,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:03,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1332796270, now seen corresponding path program 1 times [2020-12-09 10:16:03,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:03,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992032257] [2020-12-09 10:16:03,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:03,601 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 10:16:03,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992032257] [2020-12-09 10:16:03,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:16:03,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:16:03,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083913352] [2020-12-09 10:16:03,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 10:16:03,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:03,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 10:16:03,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 10:16:03,603 INFO L87 Difference]: Start difference. First operand 253 states and 345 transitions. Second operand 3 states. [2020-12-09 10:16:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:03,616 INFO L93 Difference]: Finished difference Result 322 states and 412 transitions. [2020-12-09 10:16:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 10:16:03,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-12-09 10:16:03,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:03,618 INFO L225 Difference]: With dead ends: 322 [2020-12-09 10:16:03,618 INFO L226 Difference]: Without dead ends: 322 [2020-12-09 10:16:03,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 10:16:03,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-12-09 10:16:03,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 234. [2020-12-09 10:16:03,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-12-09 10:16:03,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 308 transitions. [2020-12-09 10:16:03,623 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 308 transitions. Word has length 17 [2020-12-09 10:16:03,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:03,624 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 308 transitions. [2020-12-09 10:16:03,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 10:16:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 308 transitions. [2020-12-09 10:16:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 10:16:03,624 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:03,624 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 10:16:03,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-12-09 10:16:03,625 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:16:03,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:03,625 INFO L82 PathProgramCache]: Analyzing trace with hash 672798198, now seen corresponding path program 1 times [2020-12-09 10:16:03,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:03,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126260646] [2020-12-09 10:16:03,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:03,682 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 10:16:03,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126260646] [2020-12-09 10:16:03,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:16:03,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:16:03,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171410706] [2020-12-09 10:16:03,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:16:03,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:03,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:16:03,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:16:03,683 INFO L87 Difference]: Start difference. First operand 234 states and 308 transitions. Second operand 5 states. [2020-12-09 10:16:03,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:03,823 INFO L93 Difference]: Finished difference Result 307 states and 363 transitions. [2020-12-09 10:16:03,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 10:16:03,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-12-09 10:16:03,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:03,825 INFO L225 Difference]: With dead ends: 307 [2020-12-09 10:16:03,825 INFO L226 Difference]: Without dead ends: 307 [2020-12-09 10:16:03,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-09 10:16:03,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2020-12-09 10:16:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 230. [2020-12-09 10:16:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-09 10:16:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 285 transitions. [2020-12-09 10:16:03,831 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 285 transitions. Word has length 19 [2020-12-09 10:16:03,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:03,832 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 285 transitions. [2020-12-09 10:16:03,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:16:03,832 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 285 transitions. [2020-12-09 10:16:03,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 10:16:03,832 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:03,833 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 10:16:03,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-12-09 10:16:03,833 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:16:03,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:03,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1363071017, now seen corresponding path program 1 times [2020-12-09 10:16:03,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:03,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127042487] [2020-12-09 10:16:03,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:03,882 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 10:16:03,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127042487] [2020-12-09 10:16:03,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:16:03,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:16:03,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960142855] [2020-12-09 10:16:03,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:16:03,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:03,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:16:03,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:16:03,883 INFO L87 Difference]: Start difference. First operand 230 states and 285 transitions. Second operand 5 states. [2020-12-09 10:16:03,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:03,978 INFO L93 Difference]: Finished difference Result 287 states and 344 transitions. [2020-12-09 10:16:03,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 10:16:03,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-12-09 10:16:03,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:03,981 INFO L225 Difference]: With dead ends: 287 [2020-12-09 10:16:03,981 INFO L226 Difference]: Without dead ends: 287 [2020-12-09 10:16:03,981 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 10:16:03,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-12-09 10:16:03,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 229. [2020-12-09 10:16:03,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-12-09 10:16:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 281 transitions. [2020-12-09 10:16:03,987 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 281 transitions. Word has length 20 [2020-12-09 10:16:03,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:03,988 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 281 transitions. [2020-12-09 10:16:03,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:16:03,988 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 281 transitions. [2020-12-09 10:16:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 10:16:03,988 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:03,989 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 10:16:03,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-12-09 10:16:03,989 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:16:03,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:03,989 INFO L82 PathProgramCache]: Analyzing trace with hash 694471571, now seen corresponding path program 1 times [2020-12-09 10:16:03,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:03,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996071518] [2020-12-09 10:16:03,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:04,050 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 10:16:04,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996071518] [2020-12-09 10:16:04,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:16:04,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 10:16:04,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811220884] [2020-12-09 10:16:04,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:16:04,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:04,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:16:04,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:16:04,051 INFO L87 Difference]: Start difference. First operand 229 states and 281 transitions. Second operand 4 states. [2020-12-09 10:16:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:04,141 INFO L93 Difference]: Finished difference Result 316 states and 380 transitions. [2020-12-09 10:16:04,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:16:04,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-12-09 10:16:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:04,143 INFO L225 Difference]: With dead ends: 316 [2020-12-09 10:16:04,143 INFO L226 Difference]: Without dead ends: 316 [2020-12-09 10:16:04,143 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 10:16:04,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-12-09 10:16:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 241. [2020-12-09 10:16:04,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-12-09 10:16:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 298 transitions. [2020-12-09 10:16:04,147 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 298 transitions. Word has length 21 [2020-12-09 10:16:04,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:04,147 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 298 transitions. [2020-12-09 10:16:04,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:16:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 298 transitions. [2020-12-09 10:16:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 10:16:04,148 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:04,148 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 10:16:04,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-12-09 10:16:04,148 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:16:04,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:04,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1980992075, now seen corresponding path program 1 times [2020-12-09 10:16:04,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:04,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866894692] [2020-12-09 10:16:04,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:04,354 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 10:16:04,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866894692] [2020-12-09 10:16:04,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:16:04,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 10:16:04,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082429423] [2020-12-09 10:16:04,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 10:16:04,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:04,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 10:16:04,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-09 10:16:04,355 INFO L87 Difference]: Start difference. First operand 241 states and 298 transitions. Second operand 7 states. [2020-12-09 10:16:04,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:04,699 INFO L93 Difference]: Finished difference Result 310 states and 361 transitions. [2020-12-09 10:16:04,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 10:16:04,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-12-09 10:16:04,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:04,701 INFO L225 Difference]: With dead ends: 310 [2020-12-09 10:16:04,701 INFO L226 Difference]: Without dead ends: 310 [2020-12-09 10:16:04,701 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-12-09 10:16:04,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2020-12-09 10:16:04,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 240. [2020-12-09 10:16:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2020-12-09 10:16:04,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 292 transitions. [2020-12-09 10:16:04,705 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 292 transitions. Word has length 21 [2020-12-09 10:16:04,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:04,705 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 292 transitions. [2020-12-09 10:16:04,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 10:16:04,705 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 292 transitions. [2020-12-09 10:16:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 10:16:04,706 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:04,706 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 10:16:04,706 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-12-09 10:16:04,706 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:16:04,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:04,707 INFO L82 PathProgramCache]: Analyzing trace with hash 783755557, now seen corresponding path program 1 times [2020-12-09 10:16:04,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:04,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889457383] [2020-12-09 10:16:04,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:04,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 10:16:04,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889457383] [2020-12-09 10:16:04,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104720083] [2020-12-09 10:16:04,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 10:16:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:04,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 10:16:04,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:16:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 10:16:04,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 10:16:04,980 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 10:16:04,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [421858134] [2020-12-09 10:16:04,982 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2020-12-09 10:16:04,982 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 10:16:04,982 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 10:16:04,982 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 10:16:04,982 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 10:16:05,009 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:16:05,094 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:16:05,103 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:16:05,798 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 10:16:06,039 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-12-09 10:16:06,172 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2020-12-09 10:16:06,361 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2020-12-09 10:16:06,550 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2020-12-09 10:16:06,758 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2020-12-09 10:16:07,206 WARN L197 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 83 [2020-12-09 10:16:09,368 WARN L197 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 265 DAG size of output: 203 [2020-12-09 10:16:11,453 WARN L197 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 260 DAG size of output: 199 [2020-12-09 10:16:11,605 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2020-12-09 10:16:11,831 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 10:16:11,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 10:16:11,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2020-12-09 10:16:11,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239923503] [2020-12-09 10:16:11,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 10:16:11,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:11,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 10:16:11,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2020-12-09 10:16:11,833 INFO L87 Difference]: Start difference. First operand 240 states and 292 transitions. Second operand 13 states. [2020-12-09 10:16:12,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:12,174 INFO L93 Difference]: Finished difference Result 395 states and 452 transitions. [2020-12-09 10:16:12,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 10:16:12,175 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-12-09 10:16:12,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:12,177 INFO L225 Difference]: With dead ends: 395 [2020-12-09 10:16:12,177 INFO L226 Difference]: Without dead ends: 395 [2020-12-09 10:16:12,177 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2020-12-09 10:16:12,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2020-12-09 10:16:12,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 192. [2020-12-09 10:16:12,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-12-09 10:16:12,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 231 transitions. [2020-12-09 10:16:12,181 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 231 transitions. Word has length 22 [2020-12-09 10:16:12,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:12,181 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 231 transitions. [2020-12-09 10:16:12,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 10:16:12,181 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 231 transitions. [2020-12-09 10:16:12,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 10:16:12,181 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:12,181 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] [2020-12-09 10:16:12,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2020-12-09 10:16:12,382 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:16:12,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:12,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1062867593, now seen corresponding path program 1 times [2020-12-09 10:16:12,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:12,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643879748] [2020-12-09 10:16:12,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:12,495 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 10:16:12,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643879748] [2020-12-09 10:16:12,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:16:12,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 10:16:12,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289514766] [2020-12-09 10:16:12,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 10:16:12,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:12,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 10:16:12,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 10:16:12,497 INFO L87 Difference]: Start difference. First operand 192 states and 231 transitions. Second operand 6 states. [2020-12-09 10:16:12,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:12,659 INFO L93 Difference]: Finished difference Result 200 states and 237 transitions. [2020-12-09 10:16:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 10:16:12,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-12-09 10:16:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:12,660 INFO L225 Difference]: With dead ends: 200 [2020-12-09 10:16:12,660 INFO L226 Difference]: Without dead ends: 200 [2020-12-09 10:16:12,660 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-09 10:16:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-12-09 10:16:12,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 179. [2020-12-09 10:16:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-12-09 10:16:12,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 210 transitions. [2020-12-09 10:16:12,663 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 210 transitions. Word has length 23 [2020-12-09 10:16:12,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:12,663 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 210 transitions. [2020-12-09 10:16:12,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 10:16:12,663 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 210 transitions. [2020-12-09 10:16:12,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 10:16:12,664 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:12,664 INFO L422 BasicCegarLoop]: trace histogram [2, 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 10:16:12,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2020-12-09 10:16:12,664 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:16:12,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:12,664 INFO L82 PathProgramCache]: Analyzing trace with hash 209500793, now seen corresponding path program 1 times [2020-12-09 10:16:12,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:12,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289468072] [2020-12-09 10:16:12,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:16:12,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289468072] [2020-12-09 10:16:12,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413355554] [2020-12-09 10:16:12,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 10:16:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:12,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 10:16:12,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:16:12,886 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-12-09 10:16:12,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:16:12,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 10:16:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:16:13,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [300423571] [2020-12-09 10:16:13,013 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 10:16:13,013 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 10:16:13,013 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 10:16:13,013 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 10:16:13,013 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 10:16:13,038 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:16:13,118 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:16:13,127 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:16:13,304 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 10:16:13,884 WARN L197 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 183 [2020-12-09 10:16:14,575 WARN L197 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 191 [2020-12-09 10:16:15,461 WARN L197 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 190 [2020-12-09 10:16:16,421 WARN L197 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 204 [2020-12-09 10:16:16,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 10:16:16,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 3, 3] total 13 [2020-12-09 10:16:16,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535114543] [2020-12-09 10:16:16,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 10:16:16,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:16,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 10:16:16,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-12-09 10:16:16,423 INFO L87 Difference]: Start difference. First operand 179 states and 210 transitions. Second operand 6 states. [2020-12-09 10:16:16,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:16,838 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2020-12-09 10:16:16,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 10:16:16,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-12-09 10:16:16,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:16,839 INFO L225 Difference]: With dead ends: 181 [2020-12-09 10:16:16,839 INFO L226 Difference]: Without dead ends: 181 [2020-12-09 10:16:16,840 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-12-09 10:16:16,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-12-09 10:16:16,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2020-12-09 10:16:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-12-09 10:16:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 211 transitions. [2020-12-09 10:16:16,842 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 211 transitions. Word has length 25 [2020-12-09 10:16:16,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:16,842 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 211 transitions. [2020-12-09 10:16:16,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 10:16:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 211 transitions. [2020-12-09 10:16:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 10:16:16,843 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:16,843 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:16:17,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 10:16:17,044 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:16:17,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:17,044 INFO L82 PathProgramCache]: Analyzing trace with hash -120436131, now seen corresponding path program 1 times [2020-12-09 10:16:17,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:17,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096634] [2020-12-09 10:16:17,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:16:17,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096634] [2020-12-09 10:16:17,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686669117] [2020-12-09 10:16:17,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 10:16:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:17,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 10:16:17,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:16:17,296 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-12-09 10:16:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:16:17,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 10:16:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:16:17,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2008666560] [2020-12-09 10:16:17,598 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2020-12-09 10:16:17,598 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 10:16:17,598 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 10:16:17,598 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 10:16:17,599 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 10:16:17,622 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:16:17,633 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:16:17,715 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:16:17,942 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:16:18,263 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 10:16:18,511 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2020-12-09 10:16:19,120 WARN L197 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 183 [2020-12-09 10:16:19,923 WARN L197 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 191 [2020-12-09 10:16:20,992 WARN L197 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 190 [2020-12-09 10:16:21,967 WARN L197 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 204 [2020-12-09 10:16:22,945 WARN L197 SmtUtils]: Spent 885.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 212 [2020-12-09 10:16:23,532 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2020-12-09 10:16:23,758 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-12-09 10:16:24,007 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2020-12-09 10:16:24,286 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2020-12-09 10:16:24,610 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2020-12-09 10:16:25,282 WARN L197 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 113 [2020-12-09 10:16:25,752 WARN L197 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 107 [2020-12-09 10:16:25,752 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 10:16:25,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 10:16:25,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2020-12-09 10:16:25,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596394759] [2020-12-09 10:16:25,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-09 10:16:25,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:25,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-09 10:16:25,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2020-12-09 10:16:25,754 INFO L87 Difference]: Start difference. First operand 181 states and 211 transitions. Second operand 15 states. [2020-12-09 10:16:26,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:26,522 INFO L93 Difference]: Finished difference Result 366 states and 405 transitions. [2020-12-09 10:16:26,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 10:16:26,522 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-09 10:16:26,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:26,523 INFO L225 Difference]: With dead ends: 366 [2020-12-09 10:16:26,524 INFO L226 Difference]: Without dead ends: 366 [2020-12-09 10:16:26,524 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=296, Invalid=1344, Unknown=0, NotChecked=0, Total=1640 [2020-12-09 10:16:26,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2020-12-09 10:16:26,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 173. [2020-12-09 10:16:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-12-09 10:16:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 203 transitions. [2020-12-09 10:16:26,527 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 203 transitions. Word has length 27 [2020-12-09 10:16:26,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:26,527 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 203 transitions. [2020-12-09 10:16:26,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-09 10:16:26,527 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions. [2020-12-09 10:16:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 10:16:26,528 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:26,528 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:16:26,728 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 10:16:26,730 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:16:26,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:26,731 INFO L82 PathProgramCache]: Analyzing trace with hash 561447274, now seen corresponding path program 1 times [2020-12-09 10:16:26,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:26,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955698838] [2020-12-09 10:16:26,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:26,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:16:26,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955698838] [2020-12-09 10:16:26,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984844517] [2020-12-09 10:16:26,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 10:16:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:27,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 10:16:27,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:16:27,176 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 37 [2020-12-09 10:16:28,394 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 10:16:28,587 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 10:16:28,773 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 10:16:28,953 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 10:16:29,134 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 10:16:29,320 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 10:16:29,545 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2020-12-09 10:16:29,840 WARN L197 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 48 [2020-12-09 10:16:30,476 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2020-12-09 10:16:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:16:31,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 10:16:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:16:31,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [913891110] [2020-12-09 10:16:31,090 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2020-12-09 10:16:31,090 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 10:16:31,090 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 10:16:31,090 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 10:16:31,090 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 10:16:31,112 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:16:31,122 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:16:31,131 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:16:31,380 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:16:31,743 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 10:16:31,916 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2020-12-09 10:16:32,575 WARN L197 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 183 [2020-12-09 10:16:33,345 WARN L197 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 191 [2020-12-09 10:16:34,527 WARN L197 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 190 [2020-12-09 10:16:35,665 WARN L197 SmtUtils]: Spent 933.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 204 [2020-12-09 10:16:36,908 WARN L197 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 255 DAG size of output: 218 [2020-12-09 10:16:38,380 WARN L197 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 260 DAG size of output: 217 [2020-12-09 10:16:39,564 WARN L197 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 256 DAG size of output: 213 [2020-12-09 10:16:40,002 WARN L197 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2020-12-09 10:16:40,461 WARN L197 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2020-12-09 10:16:40,967 WARN L197 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2020-12-09 10:16:41,510 WARN L197 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2020-12-09 10:16:42,062 WARN L197 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 90 [2020-12-09 10:16:42,624 WARN L197 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2020-12-09 10:16:42,827 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2020-12-09 10:16:42,879 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 10:16:42,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 10:16:42,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 14 [2020-12-09 10:16:42,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831358113] [2020-12-09 10:16:42,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-09 10:16:42,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:16:42,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-09 10:16:42,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=744, Unknown=0, NotChecked=0, Total=930 [2020-12-09 10:16:42,881 INFO L87 Difference]: Start difference. First operand 173 states and 203 transitions. Second operand 16 states. [2020-12-09 10:16:43,132 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2020-12-09 10:16:44,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:16:44,027 INFO L93 Difference]: Finished difference Result 335 states and 384 transitions. [2020-12-09 10:16:44,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 10:16:44,027 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2020-12-09 10:16:44,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:16:44,029 INFO L225 Difference]: With dead ends: 335 [2020-12-09 10:16:44,029 INFO L226 Difference]: Without dead ends: 335 [2020-12-09 10:16:44,029 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 28 SyntacticMatches, 34 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=252, Invalid=1008, Unknown=0, NotChecked=0, Total=1260 [2020-12-09 10:16:44,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-12-09 10:16:44,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 190. [2020-12-09 10:16:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-12-09 10:16:44,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 229 transitions. [2020-12-09 10:16:44,032 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 229 transitions. Word has length 28 [2020-12-09 10:16:44,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:16:44,033 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 229 transitions. [2020-12-09 10:16:44,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-09 10:16:44,033 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 229 transitions. [2020-12-09 10:16:44,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-09 10:16:44,033 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:16:44,033 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:16:44,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 10:16:44,235 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:16:44,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:16:44,236 INFO L82 PathProgramCache]: Analyzing trace with hash 224996444, now seen corresponding path program 1 times [2020-12-09 10:16:44,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:16:44,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134174616] [2020-12-09 10:16:44,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:16:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:44,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:16:44,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134174616] [2020-12-09 10:16:44,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318393579] [2020-12-09 10:16:44,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 10:16:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:16:44,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-09 10:16:44,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:16:44,704 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2020-12-09 10:16:45,576 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2020-12-09 10:16:45,959 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-12-09 10:16:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:16:46,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 10:17:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:17:09,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1583455168] [2020-12-09 10:17:09,269 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2020-12-09 10:17:09,269 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 10:17:09,269 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 10:17:09,269 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 10:17:09,269 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 10:17:09,292 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:09,302 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:09,311 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:09,602 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:09,930 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 10:17:10,259 WARN L197 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 86 [2020-12-09 10:17:11,005 WARN L197 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 183 [2020-12-09 10:17:11,916 WARN L197 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 191 [2020-12-09 10:17:13,392 WARN L197 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 190 [2020-12-09 10:17:14,638 WARN L197 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 235 DAG size of output: 204 [2020-12-09 10:17:15,765 WARN L197 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 212 [2020-12-09 10:17:17,290 WARN L197 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 263 DAG size of output: 212 [2020-12-09 10:17:18,462 WARN L197 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 259 DAG size of output: 208 [2020-12-09 10:17:18,743 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-12-09 10:17:18,992 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2020-12-09 10:17:19,301 WARN L197 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2020-12-09 10:17:19,624 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2020-12-09 10:17:19,957 WARN L197 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2020-12-09 10:17:20,367 WARN L197 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2020-12-09 10:17:20,666 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2020-12-09 10:17:20,750 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 10:17:20,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 10:17:20,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2020-12-09 10:17:20,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711638192] [2020-12-09 10:17:20,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-09 10:17:20,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:17:20,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-09 10:17:20,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1021, Unknown=1, NotChecked=0, Total=1260 [2020-12-09 10:17:20,752 INFO L87 Difference]: Start difference. First operand 190 states and 229 transitions. Second operand 21 states. [2020-12-09 10:17:23,066 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2020-12-09 10:17:23,584 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2020-12-09 10:17:23,756 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2020-12-09 10:17:23,973 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2020-12-09 10:17:24,231 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2020-12-09 10:17:25,149 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2020-12-09 10:17:25,322 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2020-12-09 10:17:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:17:27,101 INFO L93 Difference]: Finished difference Result 597 states and 674 transitions. [2020-12-09 10:17:27,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-12-09 10:17:27,102 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2020-12-09 10:17:27,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:17:27,104 INFO L225 Difference]: With dead ends: 597 [2020-12-09 10:17:27,104 INFO L226 Difference]: Without dead ends: 597 [2020-12-09 10:17:27,105 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 25 SyntacticMatches, 34 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1813 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=711, Invalid=3578, Unknown=1, NotChecked=0, Total=4290 [2020-12-09 10:17:27,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-12-09 10:17:27,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 188. [2020-12-09 10:17:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-12-09 10:17:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 226 transitions. [2020-12-09 10:17:27,109 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 226 transitions. Word has length 29 [2020-12-09 10:17:27,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:17:27,109 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 226 transitions. [2020-12-09 10:17:27,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-09 10:17:27,110 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 226 transitions. [2020-12-09 10:17:27,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-09 10:17:27,110 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:17:27,110 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, 1, 1, 1, 1] [2020-12-09 10:17:27,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 10:17:27,312 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:17:27,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:17:27,313 INFO L82 PathProgramCache]: Analyzing trace with hash 162650540, now seen corresponding path program 1 times [2020-12-09 10:17:27,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:17:27,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845181054] [2020-12-09 10:17:27,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:17:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:17:27,345 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 10:17:27,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845181054] [2020-12-09 10:17:27,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:17:27,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:17:27,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478383772] [2020-12-09 10:17:27,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 10:17:27,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:17:27,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 10:17:27,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 10:17:27,346 INFO L87 Difference]: Start difference. First operand 188 states and 226 transitions. Second operand 3 states. [2020-12-09 10:17:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:17:27,357 INFO L93 Difference]: Finished difference Result 267 states and 327 transitions. [2020-12-09 10:17:27,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 10:17:27,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-12-09 10:17:27,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:17:27,359 INFO L225 Difference]: With dead ends: 267 [2020-12-09 10:17:27,359 INFO L226 Difference]: Without dead ends: 267 [2020-12-09 10:17:27,359 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 10:17:27,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-12-09 10:17:27,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 163. [2020-12-09 10:17:27,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-09 10:17:27,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 199 transitions. [2020-12-09 10:17:27,362 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 199 transitions. Word has length 30 [2020-12-09 10:17:27,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:17:27,362 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 199 transitions. [2020-12-09 10:17:27,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 10:17:27,362 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 199 transitions. [2020-12-09 10:17:27,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-09 10:17:27,362 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:17:27,362 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, 1, 1, 1, 1, 1] [2020-12-09 10:17:27,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2020-12-09 10:17:27,363 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:17:27,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:17:27,363 INFO L82 PathProgramCache]: Analyzing trace with hash 747815319, now seen corresponding path program 1 times [2020-12-09 10:17:27,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:17:27,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012900057] [2020-12-09 10:17:27,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:17:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:17:27,386 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 10:17:27,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012900057] [2020-12-09 10:17:27,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:17:27,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:17:27,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801320477] [2020-12-09 10:17:27,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:17:27,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:17:27,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:17:27,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:17:27,387 INFO L87 Difference]: Start difference. First operand 163 states and 199 transitions. Second operand 4 states. [2020-12-09 10:17:27,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:17:27,428 INFO L93 Difference]: Finished difference Result 208 states and 254 transitions. [2020-12-09 10:17:27,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:17:27,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-12-09 10:17:27,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:17:27,429 INFO L225 Difference]: With dead ends: 208 [2020-12-09 10:17:27,429 INFO L226 Difference]: Without dead ends: 208 [2020-12-09 10:17:27,429 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 10:17:27,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-12-09 10:17:27,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 161. [2020-12-09 10:17:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-12-09 10:17:27,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 197 transitions. [2020-12-09 10:17:27,432 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 197 transitions. Word has length 31 [2020-12-09 10:17:27,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:17:27,432 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 197 transitions. [2020-12-09 10:17:27,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:17:27,432 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 197 transitions. [2020-12-09 10:17:27,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-09 10:17:27,432 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:17:27,432 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, 1, 1, 1, 1, 1, 1] [2020-12-09 10:17:27,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2020-12-09 10:17:27,432 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:17:27,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:17:27,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1707438595, now seen corresponding path program 1 times [2020-12-09 10:17:27,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:17:27,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65905335] [2020-12-09 10:17:27,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:17:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:17:27,458 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 10:17:27,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65905335] [2020-12-09 10:17:27,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:17:27,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:17:27,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605657238] [2020-12-09 10:17:27,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:17:27,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:17:27,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:17:27,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:17:27,460 INFO L87 Difference]: Start difference. First operand 161 states and 197 transitions. Second operand 4 states. [2020-12-09 10:17:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:17:27,521 INFO L93 Difference]: Finished difference Result 206 states and 252 transitions. [2020-12-09 10:17:27,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:17:27,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-12-09 10:17:27,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:17:27,522 INFO L225 Difference]: With dead ends: 206 [2020-12-09 10:17:27,522 INFO L226 Difference]: Without dead ends: 206 [2020-12-09 10:17:27,523 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 10:17:27,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-12-09 10:17:27,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 159. [2020-12-09 10:17:27,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-12-09 10:17:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 195 transitions. [2020-12-09 10:17:27,525 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 195 transitions. Word has length 32 [2020-12-09 10:17:27,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:17:27,525 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 195 transitions. [2020-12-09 10:17:27,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:17:27,525 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 195 transitions. [2020-12-09 10:17:27,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-09 10:17:27,525 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:17:27,525 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, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:17:27,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2020-12-09 10:17:27,526 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:17:27,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:17:27,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1390989081, now seen corresponding path program 1 times [2020-12-09 10:17:27,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:17:27,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709246804] [2020-12-09 10:17:27,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:17:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:17:27,559 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 10:17:27,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709246804] [2020-12-09 10:17:27,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:17:27,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:17:27,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89777314] [2020-12-09 10:17:27,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:17:27,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:17:27,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:17:27,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:17:27,560 INFO L87 Difference]: Start difference. First operand 159 states and 195 transitions. Second operand 4 states. [2020-12-09 10:17:27,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:17:27,671 INFO L93 Difference]: Finished difference Result 219 states and 267 transitions. [2020-12-09 10:17:27,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:17:27,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-12-09 10:17:27,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:17:27,672 INFO L225 Difference]: With dead ends: 219 [2020-12-09 10:17:27,672 INFO L226 Difference]: Without dead ends: 219 [2020-12-09 10:17:27,672 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:17:27,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-12-09 10:17:27,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 209. [2020-12-09 10:17:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-12-09 10:17:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 260 transitions. [2020-12-09 10:17:27,676 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 260 transitions. Word has length 33 [2020-12-09 10:17:27,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:17:27,676 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 260 transitions. [2020-12-09 10:17:27,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:17:27,676 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 260 transitions. [2020-12-09 10:17:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 10:17:27,677 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:17:27,677 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:17:27,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2020-12-09 10:17:27,677 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:17:27,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:17:27,678 INFO L82 PathProgramCache]: Analyzing trace with hash -884626401, now seen corresponding path program 1 times [2020-12-09 10:17:27,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:17:27,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148013139] [2020-12-09 10:17:27,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:17:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:17:27,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 10:17:27,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148013139] [2020-12-09 10:17:27,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:17:27,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:17:27,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609581791] [2020-12-09 10:17:27,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:17:27,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:17:27,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:17:27,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:17:27,738 INFO L87 Difference]: Start difference. First operand 209 states and 260 transitions. Second operand 5 states. [2020-12-09 10:17:27,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:17:27,827 INFO L93 Difference]: Finished difference Result 230 states and 276 transitions. [2020-12-09 10:17:27,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 10:17:27,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2020-12-09 10:17:27,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:17:27,828 INFO L225 Difference]: With dead ends: 230 [2020-12-09 10:17:27,828 INFO L226 Difference]: Without dead ends: 230 [2020-12-09 10:17:27,828 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 10:17:27,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-12-09 10:17:27,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 209. [2020-12-09 10:17:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-12-09 10:17:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 257 transitions. [2020-12-09 10:17:27,831 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 257 transitions. Word has length 36 [2020-12-09 10:17:27,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:17:27,831 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 257 transitions. [2020-12-09 10:17:27,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:17:27,831 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 257 transitions. [2020-12-09 10:17:27,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-09 10:17:27,832 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:17:27,832 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:17:27,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2020-12-09 10:17:27,832 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:17:27,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:17:27,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1653614430, now seen corresponding path program 1 times [2020-12-09 10:17:27,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:17:27,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158485000] [2020-12-09 10:17:27,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:17:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:17:27,900 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 10:17:27,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158485000] [2020-12-09 10:17:27,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:17:27,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:17:27,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832285886] [2020-12-09 10:17:27,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:17:27,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:17:27,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:17:27,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:17:27,902 INFO L87 Difference]: Start difference. First operand 209 states and 257 transitions. Second operand 5 states. [2020-12-09 10:17:27,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:17:27,973 INFO L93 Difference]: Finished difference Result 212 states and 253 transitions. [2020-12-09 10:17:27,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:17:27,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-12-09 10:17:27,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:17:27,974 INFO L225 Difference]: With dead ends: 212 [2020-12-09 10:17:27,974 INFO L226 Difference]: Without dead ends: 212 [2020-12-09 10:17:27,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 10:17:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-12-09 10:17:27,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 208. [2020-12-09 10:17:27,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-12-09 10:17:27,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 250 transitions. [2020-12-09 10:17:27,978 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 250 transitions. Word has length 37 [2020-12-09 10:17:27,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:17:27,978 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 250 transitions. [2020-12-09 10:17:27,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:17:27,978 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 250 transitions. [2020-12-09 10:17:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-09 10:17:27,979 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:17:27,979 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:17:27,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2020-12-09 10:17:27,979 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:17:27,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:17:27,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1361604076, now seen corresponding path program 1 times [2020-12-09 10:17:27,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:17:27,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172980236] [2020-12-09 10:17:27,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:17:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:17:28,036 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 10:17:28,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172980236] [2020-12-09 10:17:28,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:17:28,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 10:17:28,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155279956] [2020-12-09 10:17:28,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 10:17:28,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:17:28,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 10:17:28,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 10:17:28,038 INFO L87 Difference]: Start difference. First operand 208 states and 250 transitions. Second operand 6 states. [2020-12-09 10:17:28,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:17:28,131 INFO L93 Difference]: Finished difference Result 214 states and 256 transitions. [2020-12-09 10:17:28,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:17:28,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-12-09 10:17:28,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:17:28,132 INFO L225 Difference]: With dead ends: 214 [2020-12-09 10:17:28,132 INFO L226 Difference]: Without dead ends: 214 [2020-12-09 10:17:28,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 10:17:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-12-09 10:17:28,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 207. [2020-12-09 10:17:28,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-12-09 10:17:28,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 249 transitions. [2020-12-09 10:17:28,135 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 249 transitions. Word has length 38 [2020-12-09 10:17:28,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:17:28,135 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 249 transitions. [2020-12-09 10:17:28,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 10:17:28,135 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 249 transitions. [2020-12-09 10:17:28,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-09 10:17:28,135 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:17:28,135 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:17:28,136 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2020-12-09 10:17:28,136 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:17:28,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:17:28,136 INFO L82 PathProgramCache]: Analyzing trace with hash 739946761, now seen corresponding path program 1 times [2020-12-09 10:17:28,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:17:28,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711255308] [2020-12-09 10:17:28,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:17:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:17:28,529 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 10:17:28,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711255308] [2020-12-09 10:17:28,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:17:28,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-09 10:17:28,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105583151] [2020-12-09 10:17:28,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 10:17:28,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:17:28,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 10:17:28,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2020-12-09 10:17:28,530 INFO L87 Difference]: Start difference. First operand 207 states and 249 transitions. Second operand 17 states. [2020-12-09 10:17:28,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:17:28,915 INFO L93 Difference]: Finished difference Result 261 states and 307 transitions. [2020-12-09 10:17:28,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 10:17:28,915 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2020-12-09 10:17:28,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:17:28,916 INFO L225 Difference]: With dead ends: 261 [2020-12-09 10:17:28,916 INFO L226 Difference]: Without dead ends: 261 [2020-12-09 10:17:28,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2020-12-09 10:17:28,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2020-12-09 10:17:28,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 207. [2020-12-09 10:17:28,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-12-09 10:17:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 248 transitions. [2020-12-09 10:17:28,919 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 248 transitions. Word has length 39 [2020-12-09 10:17:28,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:17:28,919 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 248 transitions. [2020-12-09 10:17:28,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 10:17:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 248 transitions. [2020-12-09 10:17:28,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-09 10:17:28,920 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:17:28,920 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:17:28,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2020-12-09 10:17:28,920 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:17:28,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:17:28,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1875726741, now seen corresponding path program 1 times [2020-12-09 10:17:28,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:17:28,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965181975] [2020-12-09 10:17:28,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:17:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:17:29,023 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 10:17:29,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965181975] [2020-12-09 10:17:29,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:17:29,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 10:17:29,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714969266] [2020-12-09 10:17:29,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 10:17:29,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:17:29,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 10:17:29,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-12-09 10:17:29,024 INFO L87 Difference]: Start difference. First operand 207 states and 248 transitions. Second operand 9 states. [2020-12-09 10:17:29,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:17:29,318 INFO L93 Difference]: Finished difference Result 218 states and 258 transitions. [2020-12-09 10:17:29,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 10:17:29,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2020-12-09 10:17:29,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:17:29,320 INFO L225 Difference]: With dead ends: 218 [2020-12-09 10:17:29,320 INFO L226 Difference]: Without dead ends: 218 [2020-12-09 10:17:29,320 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2020-12-09 10:17:29,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-12-09 10:17:29,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 206. [2020-12-09 10:17:29,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-12-09 10:17:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 247 transitions. [2020-12-09 10:17:29,322 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 247 transitions. Word has length 41 [2020-12-09 10:17:29,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:17:29,323 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 247 transitions. [2020-12-09 10:17:29,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 10:17:29,323 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 247 transitions. [2020-12-09 10:17:29,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-12-09 10:17:29,323 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:17:29,323 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:17:29,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2020-12-09 10:17:29,323 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:17:29,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:17:29,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2083072908, now seen corresponding path program 1 times [2020-12-09 10:17:29,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:17:29,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474533716] [2020-12-09 10:17:29,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:17:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:17:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-09 10:17:29,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474533716] [2020-12-09 10:17:29,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:17:29,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 10:17:29,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783572433] [2020-12-09 10:17:29,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 10:17:29,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:17:29,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 10:17:29,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 10:17:29,346 INFO L87 Difference]: Start difference. First operand 206 states and 247 transitions. Second operand 3 states. [2020-12-09 10:17:29,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:17:29,375 INFO L93 Difference]: Finished difference Result 212 states and 252 transitions. [2020-12-09 10:17:29,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 10:17:29,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-12-09 10:17:29,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:17:29,377 INFO L225 Difference]: With dead ends: 212 [2020-12-09 10:17:29,377 INFO L226 Difference]: Without dead ends: 212 [2020-12-09 10:17:29,377 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 10:17:29,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-12-09 10:17:29,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 186. [2020-12-09 10:17:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-12-09 10:17:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 223 transitions. [2020-12-09 10:17:29,379 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 223 transitions. Word has length 43 [2020-12-09 10:17:29,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:17:29,380 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 223 transitions. [2020-12-09 10:17:29,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 10:17:29,380 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 223 transitions. [2020-12-09 10:17:29,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-09 10:17:29,380 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:17:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:17:29,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2020-12-09 10:17:29,380 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:17:29,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:17:29,381 INFO L82 PathProgramCache]: Analyzing trace with hash -19654730, now seen corresponding path program 1 times [2020-12-09 10:17:29,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:17:29,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235407169] [2020-12-09 10:17:29,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:17:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:17:29,502 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 10:17:29,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235407169] [2020-12-09 10:17:29,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:17:29,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 10:17:29,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478081818] [2020-12-09 10:17:29,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 10:17:29,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:17:29,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 10:17:29,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-09 10:17:29,503 INFO L87 Difference]: Start difference. First operand 186 states and 223 transitions. Second operand 7 states. [2020-12-09 10:17:29,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:17:29,742 INFO L93 Difference]: Finished difference Result 397 states and 463 transitions. [2020-12-09 10:17:29,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 10:17:29,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2020-12-09 10:17:29,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:17:29,744 INFO L225 Difference]: With dead ends: 397 [2020-12-09 10:17:29,744 INFO L226 Difference]: Without dead ends: 397 [2020-12-09 10:17:29,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-09 10:17:29,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2020-12-09 10:17:29,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 196. [2020-12-09 10:17:29,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-12-09 10:17:29,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 233 transitions. [2020-12-09 10:17:29,747 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 233 transitions. Word has length 46 [2020-12-09 10:17:29,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:17:29,748 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 233 transitions. [2020-12-09 10:17:29,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 10:17:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 233 transitions. [2020-12-09 10:17:29,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-09 10:17:29,748 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:17:29,748 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:17:29,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2020-12-09 10:17:29,748 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:17:29,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:17:29,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1266175234, now seen corresponding path program 1 times [2020-12-09 10:17:29,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:17:29,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315175529] [2020-12-09 10:17:29,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:17:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:17:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:17:30,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315175529] [2020-12-09 10:17:30,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734395083] [2020-12-09 10:17:30,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 10:17:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:17:30,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 27 conjunts are in the unsatisfiable core [2020-12-09 10:17:30,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:17:30,358 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2020-12-09 10:17:31,414 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-12-09 10:17:31,585 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-12-09 10:17:31,811 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-12-09 10:17:31,987 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-12-09 10:17:32,155 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-12-09 10:17:32,298 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-12-09 10:17:32,701 WARN L197 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2020-12-09 10:17:33,053 WARN L197 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 85 [2020-12-09 10:17:33,433 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 77 [2020-12-09 10:17:33,944 WARN L197 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2020-12-09 10:17:34,180 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-12-09 10:17:34,493 WARN L197 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 88 [2020-12-09 10:17:34,949 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-12-09 10:17:35,177 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-12-09 10:17:35,546 WARN L197 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 103 [2020-12-09 10:17:36,096 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2020-12-09 10:17:36,245 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-12-09 10:17:36,246 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-12-09 10:17:38,183 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-12-09 10:17:38,185 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-12-09 10:17:42,919 WARN L197 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 221 DAG size of output: 100 [2020-12-09 10:17:43,969 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-12-09 10:17:44,271 WARN L197 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 115 [2020-12-09 10:17:44,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:17:44,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 10:17:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:17:45,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [887916364] [2020-12-09 10:17:45,248 INFO L159 IcfgInterpreter]: Started Sifa with 45 locations of interest [2020-12-09 10:17:45,248 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 10:17:45,248 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 10:17:45,248 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 10:17:45,248 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 10:17:45,391 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:45,402 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:45,413 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:45,804 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:46,342 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:46,360 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:46,378 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:46,580 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2020-12-09 10:17:46,603 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:46,786 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-12-09 10:17:46,975 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-12-09 10:17:46,994 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:47,017 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:47,214 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-12-09 10:17:47,234 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:47,425 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-12-09 10:17:47,444 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:47,634 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-12-09 10:17:47,654 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:47,671 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:47,852 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-12-09 10:17:47,872 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:47,891 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:48,069 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-12-09 10:17:48,215 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:48,405 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-12-09 10:17:48,423 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:48,621 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2020-12-09 10:17:48,638 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:48,827 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-12-09 10:17:49,022 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-12-09 10:17:49,040 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 10:17:49,242 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-12-09 10:17:49,547 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-12-09 10:17:49,692 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2020-12-09 10:17:49,752 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,763 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,771 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,778 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,785 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,791 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,797 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,804 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,810 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,816 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,822 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,829 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,835 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,841 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,848 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,854 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,879 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,885 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,891 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,897 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,903 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,910 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,916 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,922 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,928 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,934 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,941 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,947 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,953 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,959 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,967 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:49,973 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:50,601 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:50,607 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:50,613 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:50,619 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:50,625 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:50,631 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:50,637 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:50,643 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:50,649 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:50,655 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:50,661 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:50,667 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:50,673 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:50,679 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:50,685 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:50,691 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-12-09 10:17:50,855 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 10:17:51,027 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-12-09 10:17:51,928 WARN L197 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 183 [2020-12-09 10:17:53,066 WARN L197 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 191 [2020-12-09 10:17:55,508 WARN L197 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 190 [2020-12-09 10:17:57,290 WARN L197 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 235 DAG size of output: 204 [2020-12-09 10:17:58,608 WARN L197 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 264 DAG size of output: 212 [2020-12-09 10:17:58,815 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-12-09 10:17:59,114 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-12-09 10:17:59,693 WARN L197 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2020-12-09 10:18:00,047 WARN L197 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2020-12-09 10:18:00,397 WARN L197 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2020-12-09 10:18:00,757 WARN L197 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 94 [2020-12-09 10:18:01,138 WARN L197 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 96 [2020-12-09 10:18:01,532 WARN L197 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 92 [2020-12-09 10:18:01,932 WARN L197 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 98 [2020-12-09 10:18:02,326 WARN L197 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2020-12-09 10:18:02,837 WARN L197 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 109 [2020-12-09 10:18:04,338 WARN L197 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 142 DAG size of output: 127 [2020-12-09 10:18:06,058 WARN L197 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 154 DAG size of output: 131 [2020-12-09 10:18:07,825 WARN L197 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 155 DAG size of output: 132 [2020-12-09 10:18:08,206 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-12-09 10:18:08,867 WARN L197 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 109 [2020-12-09 10:18:09,558 WARN L197 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 112 [2020-12-09 10:18:10,240 WARN L197 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 112 [2020-12-09 10:18:10,979 WARN L197 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 112 [2020-12-09 10:18:11,607 WARN L197 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 107 [2020-12-09 10:18:11,608 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 10:18:11,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 10:18:11,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 25 [2020-12-09 10:18:11,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69240484] [2020-12-09 10:18:11,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-09 10:18:11,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:18:11,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-09 10:18:11,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=2617, Unknown=0, NotChecked=0, Total=2970 [2020-12-09 10:18:11,610 INFO L87 Difference]: Start difference. First operand 196 states and 233 transitions. Second operand 27 states. [2020-12-09 10:18:13,356 WARN L197 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 200 DAG size of output: 141 [2020-12-09 10:18:19,028 WARN L197 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 203 DAG size of output: 144 [2020-12-09 10:18:21,286 WARN L197 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 206 DAG size of output: 136 [2020-12-09 10:18:24,119 WARN L197 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 232 DAG size of output: 149 [2020-12-09 10:18:24,544 WARN L197 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 97 [2020-12-09 10:18:25,189 WARN L197 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 99 [2020-12-09 10:18:26,840 WARN L197 SmtUtils]: Spent 736.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 136 [2020-12-09 10:18:32,687 WARN L197 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 195 DAG size of output: 136 [2020-12-09 10:18:33,259 WARN L197 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 102 [2020-12-09 10:18:33,525 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 65 [2020-12-09 10:18:39,988 WARN L197 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 198 DAG size of output: 139 [2020-12-09 10:18:42,681 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 67 [2020-12-09 10:18:43,409 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 66 [2020-12-09 10:18:44,755 WARN L197 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 98 [2020-12-09 10:18:45,248 WARN L197 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 97 [2020-12-09 10:18:45,861 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 64 [2020-12-09 10:18:50,792 WARN L197 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 94 [2020-12-09 10:18:51,962 WARN L197 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 136 [2020-12-09 10:18:57,015 WARN L197 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 139 [2020-12-09 10:18:58,028 WARN L197 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 136 [2020-12-09 10:19:05,345 WARN L197 SmtUtils]: Spent 985.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 149 [2020-12-09 10:19:06,638 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2020-12-09 10:19:11,049 WARN L197 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 136 [2020-12-09 10:19:13,174 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2020-12-09 10:19:14,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:19:14,454 INFO L93 Difference]: Finished difference Result 315 states and 351 transitions. [2020-12-09 10:19:14,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-09 10:19:14,455 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 47 [2020-12-09 10:19:14,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:19:14,456 INFO L225 Difference]: With dead ends: 315 [2020-12-09 10:19:14,456 INFO L226 Difference]: Without dead ends: 315 [2020-12-09 10:19:14,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 65 SyntacticMatches, 33 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2550 ImplicationChecksByTransitivity, 63.2s TimeCoverageRelationStatistics Valid=816, Invalid=5344, Unknown=2, NotChecked=0, Total=6162 [2020-12-09 10:19:14,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-12-09 10:19:14,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 195. [2020-12-09 10:19:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-12-09 10:19:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 232 transitions. [2020-12-09 10:19:14,463 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 232 transitions. Word has length 47 [2020-12-09 10:19:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:19:14,463 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 232 transitions. [2020-12-09 10:19:14,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-09 10:19:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 232 transitions. [2020-12-09 10:19:14,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-09 10:19:14,463 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:19:14,464 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, 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 10:19:14,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable194 [2020-12-09 10:19:14,665 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:19:14,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:19:14,666 INFO L82 PathProgramCache]: Analyzing trace with hash -384525554, now seen corresponding path program 1 times [2020-12-09 10:19:14,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:19:14,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072451796] [2020-12-09 10:19:14,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:19:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:19:14,694 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 10:19:14,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072451796] [2020-12-09 10:19:14,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:19:14,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 10:19:14,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836946292] [2020-12-09 10:19:14,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:19:14,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:19:14,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:19:14,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:19:14,695 INFO L87 Difference]: Start difference. First operand 195 states and 232 transitions. Second operand 4 states. [2020-12-09 10:19:14,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:19:14,756 INFO L93 Difference]: Finished difference Result 201 states and 234 transitions. [2020-12-09 10:19:14,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:19:14,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-12-09 10:19:14,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:19:14,758 INFO L225 Difference]: With dead ends: 201 [2020-12-09 10:19:14,758 INFO L226 Difference]: Without dead ends: 201 [2020-12-09 10:19:14,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:19:14,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-12-09 10:19:14,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 195. [2020-12-09 10:19:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-12-09 10:19:14,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 229 transitions. [2020-12-09 10:19:14,760 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 229 transitions. Word has length 50 [2020-12-09 10:19:14,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:19:14,760 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 229 transitions. [2020-12-09 10:19:14,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:19:14,760 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 229 transitions. [2020-12-09 10:19:14,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-09 10:19:14,761 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:19:14,761 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, 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 10:19:14,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable234 [2020-12-09 10:19:14,761 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:19:14,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:19:14,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2147087682, now seen corresponding path program 1 times [2020-12-09 10:19:14,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:19:14,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257670850] [2020-12-09 10:19:14,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:19:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:19:14,803 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 10:19:14,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257670850] [2020-12-09 10:19:14,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:19:14,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 10:19:14,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295272733] [2020-12-09 10:19:14,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:19:14,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:19:14,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:19:14,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:19:14,804 INFO L87 Difference]: Start difference. First operand 195 states and 229 transitions. Second operand 5 states. [2020-12-09 10:19:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:19:14,974 INFO L93 Difference]: Finished difference Result 200 states and 233 transitions. [2020-12-09 10:19:14,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 10:19:14,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2020-12-09 10:19:14,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:19:14,976 INFO L225 Difference]: With dead ends: 200 [2020-12-09 10:19:14,977 INFO L226 Difference]: Without dead ends: 200 [2020-12-09 10:19:14,977 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 10:19:14,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-12-09 10:19:14,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 161. [2020-12-09 10:19:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-12-09 10:19:14,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 189 transitions. [2020-12-09 10:19:14,979 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 189 transitions. Word has length 52 [2020-12-09 10:19:14,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:19:14,979 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 189 transitions. [2020-12-09 10:19:14,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:19:14,979 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 189 transitions. [2020-12-09 10:19:14,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-09 10:19:14,980 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:19:14,980 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:19:14,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable235 [2020-12-09 10:19:14,980 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:19:14,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:19:14,981 INFO L82 PathProgramCache]: Analyzing trace with hash 678870213, now seen corresponding path program 1 times [2020-12-09 10:19:14,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:19:14,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519798024] [2020-12-09 10:19:14,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:19:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 10:19:15,008 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 10:19:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 10:19:15,034 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 10:19:15,057 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 10:19:15,058 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 10:19:15,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236 [2020-12-09 10:19:15,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 10:19:15 BoogieIcfgContainer [2020-12-09 10:19:15,117 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 10:19:15,117 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 10:19:15,117 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 10:19:15,117 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 10:19:15,118 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:15:49" (3/4) ... [2020-12-09 10:19:15,120 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-09 10:19:15,120 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 10:19:15,120 INFO L168 Benchmark]: Toolchain (without parser) took 207017.01 ms. Allocated memory was 96.5 MB in the beginning and 209.7 MB in the end (delta: 113.2 MB). Free memory was 55.1 MB in the beginning and 75.6 MB in the end (delta: -20.5 MB). Peak memory consumption was 95.8 MB. Max. memory is 16.1 GB. [2020-12-09 10:19:15,120 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 96.5 MB. Free memory is still 72.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 10:19:15,121 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.78 ms. Allocated memory is still 96.5 MB. Free memory was 54.9 MB in the beginning and 49.1 MB in the end (delta: 5.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. [2020-12-09 10:19:15,121 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.22 ms. Allocated memory is still 96.5 MB. Free memory was 49.1 MB in the beginning and 46.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 10:19:15,121 INFO L168 Benchmark]: Boogie Preprocessor took 28.05 ms. Allocated memory is still 96.5 MB. Free memory was 46.7 MB in the beginning and 44.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 10:19:15,121 INFO L168 Benchmark]: RCFGBuilder took 567.93 ms. Allocated memory was 96.5 MB in the beginning and 119.5 MB in the end (delta: 23.1 MB). Free memory was 44.6 MB in the beginning and 76.6 MB in the end (delta: -32.0 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-12-09 10:19:15,121 INFO L168 Benchmark]: TraceAbstraction took 206032.37 ms. Allocated memory was 119.5 MB in the beginning and 209.7 MB in the end (delta: 90.2 MB). Free memory was 76.0 MB in the beginning and 75.6 MB in the end (delta: 386.8 kB). Peak memory consumption was 93.5 MB. Max. memory is 16.1 GB. [2020-12-09 10:19:15,121 INFO L168 Benchmark]: Witness Printer took 2.68 ms. Allocated memory is still 209.7 MB. Free memory is still 75.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 10:19:15,122 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 96.5 MB. Free memory is still 72.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 340.78 ms. Allocated memory is still 96.5 MB. Free memory was 54.9 MB in the beginning and 49.1 MB in the end (delta: 5.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.22 ms. Allocated memory is still 96.5 MB. Free memory was 49.1 MB in the beginning and 46.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.05 ms. Allocated memory is still 96.5 MB. Free memory was 46.7 MB in the beginning and 44.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 567.93 ms. Allocated memory was 96.5 MB in the beginning and 119.5 MB in the end (delta: 23.1 MB). Free memory was 44.6 MB in the beginning and 76.6 MB in the end (delta: -32.0 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 206032.37 ms. Allocated memory was 119.5 MB in the beginning and 209.7 MB in the end (delta: 90.2 MB). Free memory was 76.0 MB in the beginning and 75.6 MB in the end (delta: 386.8 kB). Peak memory consumption was 93.5 MB. Max. memory is 16.1 GB. * Witness Printer took 2.68 ms. Allocated memory is still 209.7 MB. Free memory is still 75.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 721]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693, overapproximation of memtrack at line 721. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L692] int i = 0; VAL [commands={10:0}, global={0:0}, state=0] [L692] COND TRUE i < 2 VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR commands[i].name VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [commands={10:0}, global={0:0}, state=0] [L692] COND TRUE i < 2 VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR commands[i].name VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [commands={10:0}, global={0:0}, state=0] [L692] COND FALSE !(i < 2) VAL [commands={10:0}, global={0:0}, state=0] [L692] int i = 0; VAL [commands={10:0}, global={0:0}, state=0] [L692] COND TRUE i < 2 VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR commands[i].name VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [commands={10:0}, global={0:0}, state=0] [L692] COND TRUE i < 2 VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR commands[i].name VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [commands={10:0}, global={0:0}, state=0] [L692] COND FALSE !(i < 2) VAL [commands={10:0}, global={0:0}, state=0] [L692] int i = 0; VAL [commands={10:0}, global={0:0}, state=0] [L692] COND TRUE i < 2 VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR commands[i].name VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [commands={10:0}, global={0:0}, state=0] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [commands={10:0}, global={0:0}, state=0] [L694] COND TRUE state >= commands[i].state_needed [L695] commands[i].function [L702] char *x = (char *)malloc(sizeof(char)); VAL [commands={10:0}, global={0:0}, state=0] [L703] COND FALSE !(!x) VAL [commands={10:0}, global={0:0}, state=0] [L706] COND FALSE !(\read(*global)) VAL [commands={10:0}, global={0:0}, state=0] [L709] global = x [L710] state = STATE_2 VAL [commands={10:0}, global={-3:0}, state=1] [L725] return 0; VAL [commands={10:0}, global={-3:0}, state=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 58 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 205.9s, OverallIterations: 34, TraceHistogramMax: 2, AutomataDifference: 75.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3244 SDtfs, 14114 SDslu, 5575 SDs, 0 SdLazy, 7207 SolverSat, 1782 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 33.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 853 GetRequests, 329 SyntacticMatches, 135 SemanticMatches, 389 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6147 ImplicationChecksByTransitivity, 143.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 2326 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 47.5s InterpolantComputationTime, 1115 NumberOfCodeBlocks, 1115 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1214 ConstructedInterpolants, 152 QuantifiedInterpolants, 1105813 SizeOfPredicates, 67 NumberOfNonLiveVariables, 1573 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 49 InterpolantComputations, 25 PerfectInterpolantSequences, 30/98 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: OVERALL_TIME[ms]: 1087, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 22, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 38, TOOLS_POST_TIME[ms]: 606, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 38, TOOLS_QUANTIFIERELIM_TIME[ms]: 593, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 297, FLUID_QUERY_TIME[ms]: 3, FLUID_QUERIES: 67, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 1, DOMAIN_JOIN_TIME[ms]: 106, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME[ms]: 196, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME[ms]: 11, DOMAIN_ISBOTTOM_APPLICATIONS: 22, DOMAIN_ISBOTTOM_TIME[ms]: 130, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 252, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 252, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 1, PATH_EXPR_TIME[ms]: 2, REGEX_TO_DAG_TIME[ms]: 2, DAG_COMPRESSION_TIME[ms]: 10, DAG_COMPRESSION_PROCESSED_NODES: 558, DAG_COMPRESSION_RETAINED_NODES: 92, 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 10:19:16,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 10:19:16,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 10:19:16,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 10:19:16,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 10:19:16,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 10:19:16,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 10:19:16,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 10:19:16,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 10:19:16,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 10:19:16,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 10:19:16,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 10:19:16,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 10:19:16,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 10:19:16,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 10:19:16,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 10:19:16,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 10:19:16,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 10:19:16,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 10:19:16,689 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 10:19:16,691 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 10:19:16,692 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 10:19:16,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 10:19:16,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 10:19:16,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 10:19:16,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 10:19:16,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 10:19:16,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 10:19:16,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 10:19:16,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 10:19:16,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 10:19:16,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 10:19:16,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 10:19:16,702 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 10:19:16,703 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 10:19:16,703 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 10:19:16,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 10:19:16,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 10:19:16,704 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 10:19:16,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 10:19:16,705 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 10:19:16,706 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2020-12-09 10:19:16,728 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 10:19:16,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 10:19:16,729 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 10:19:16,729 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 10:19:16,729 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 10:19:16,729 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 10:19:16,730 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 10:19:16,730 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 10:19:16,730 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 10:19:16,730 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 10:19:16,730 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 10:19:16,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 10:19:16,731 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 10:19:16,731 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 10:19:16,731 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 10:19:16,731 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 10:19:16,731 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 10:19:16,731 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 10:19:16,732 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 10:19:16,732 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 10:19:16,732 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 10:19:16,732 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 10:19:16,732 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 10:19:16,732 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 10:19:16,733 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 10:19:16,733 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 10:19:16,733 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 10:19:16,733 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 10:19:16,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 10:19:16,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 10:19:16,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 10:19:16,734 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 10:19:16,734 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 10:19:16,734 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 10:19:16,734 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 10:19:16,734 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 10:19:16,734 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_14d6165d-9497-4f75-8499-36acc3fe1f90/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_14d6165d-9497-4f75-8499-36acc3fe1f90/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 -> 129dca108ba5ab1702fbcd782a34bbf933adb446 [2020-12-09 10:19:16,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 10:19:16,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 10:19:16,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 10:19:16,990 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 10:19:16,991 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 10:19:16,991 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/../../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2020-12-09 10:19:17,031 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/data/969a8c2a4/0c13a9756ba048949686b87f0efe4110/FLAG9e960b598 [2020-12-09 10:19:17,543 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 10:19:17,544 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2020-12-09 10:19:17,557 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/data/969a8c2a4/0c13a9756ba048949686b87f0efe4110/FLAG9e960b598 [2020-12-09 10:19:18,065 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/data/969a8c2a4/0c13a9756ba048949686b87f0efe4110 [2020-12-09 10:19:18,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 10:19:18,069 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 10:19:18,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 10:19:18,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 10:19:18,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 10:19:18,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:19:18" (1/1) ... [2020-12-09 10:19:18,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12acab2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:18, skipping insertion in model container [2020-12-09 10:19:18,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:19:18" (1/1) ... [2020-12-09 10:19:18,080 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 10:19:18,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 10:19:18,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 10:19:18,343 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 10:19:18,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 10:19:18,438 INFO L208 MainTranslator]: Completed translation [2020-12-09 10:19:18,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:18 WrapperNode [2020-12-09 10:19:18,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 10:19:18,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 10:19:18,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 10:19:18,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 10:19:18,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:18" (1/1) ... [2020-12-09 10:19:18,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:18" (1/1) ... [2020-12-09 10:19:18,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 10:19:18,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 10:19:18,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 10:19:18,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 10:19:18,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:18" (1/1) ... [2020-12-09 10:19:18,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:18" (1/1) ... [2020-12-09 10:19:18,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:18" (1/1) ... [2020-12-09 10:19:18,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:18" (1/1) ... [2020-12-09 10:19:18,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:18" (1/1) ... [2020-12-09 10:19:18,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:18" (1/1) ... [2020-12-09 10:19:18,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:18" (1/1) ... [2020-12-09 10:19:18,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 10:19:18,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 10:19:18,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 10:19:18,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 10:19:18,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/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 10:19:18,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2020-12-09 10:19:18,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 10:19:18,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 10:19:18,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 10:19:18,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 10:19:18,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-09 10:19:18,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-09 10:19:18,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 10:19:18,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 10:19:19,174 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 10:19:19,175 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2020-12-09 10:19:19,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:19:19 BoogieIcfgContainer [2020-12-09 10:19:19,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 10:19:19,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 10:19:19,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 10:19:19,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 10:19:19,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 10:19:18" (1/3) ... [2020-12-09 10:19:19,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2050415c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:19:19, skipping insertion in model container [2020-12-09 10:19:19,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:19:18" (2/3) ... [2020-12-09 10:19:19,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2050415c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:19:19, skipping insertion in model container [2020-12-09 10:19:19,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:19:19" (3/3) ... [2020-12-09 10:19:19,183 INFO L111 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2020-12-09 10:19:19,200 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 10:19:19,204 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 58 error locations. [2020-12-09 10:19:19,212 INFO L253 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2020-12-09 10:19:19,226 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 10:19:19,226 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 10:19:19,226 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 10:19:19,226 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 10:19:19,226 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 10:19:19,226 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 10:19:19,227 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 10:19:19,227 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 10:19:19,243 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2020-12-09 10:19:19,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 10:19:19,247 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:19:19,247 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 10:19:19,248 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:19:19,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:19:19,252 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-12-09 10:19:19,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 10:19:19,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598907665] [2020-12-09 10:19:19,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/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 10:19:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:19:19,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 10:19:19,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:19:19,593 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2020-12-09 10:19:19,594 INFO L348 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2020-12-09 10:19:19,595 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 case distinctions, treesize of input 24 treesize of output 65 [2020-12-09 10:19:19,607 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 10:19:19,673 INFO L625 ElimStorePlain]: treesize reduction 12, result has 83.6 percent of original size [2020-12-09 10:19:19,695 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 10:19:19,701 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 10:19:19,706 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 10:19:19,710 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 10:19:19,713 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 10:19:19,716 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 10:19:19,723 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-12-09 10:19:19,723 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:63 [2020-12-09 10:19:19,732 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 10:19:19,735 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 10:19:19,737 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 10:19:19,740 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 10:19:19,742 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 10:19:19,745 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 10:19:19,775 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 10:19:19,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 10:19:19,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598907665] [2020-12-09 10:19:19,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:19:19,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 10:19:19,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930348360] [2020-12-09 10:19:19,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 10:19:19,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 10:19:19,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 10:19:19,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 10:19:19,791 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 3 states. [2020-12-09 10:19:20,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:19:20,053 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2020-12-09 10:19:20,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 10:19:20,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-12-09 10:19:20,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:19:20,062 INFO L225 Difference]: With dead ends: 159 [2020-12-09 10:19:20,062 INFO L226 Difference]: Without dead ends: 155 [2020-12-09 10:19:20,063 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 10:19:20,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-12-09 10:19:20,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 148. [2020-12-09 10:19:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-12-09 10:19:20,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 172 transitions. [2020-12-09 10:19:20,095 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 172 transitions. Word has length 4 [2020-12-09 10:19:20,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:19:20,095 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 172 transitions. [2020-12-09 10:19:20,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 10:19:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 172 transitions. [2020-12-09 10:19:20,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 10:19:20,096 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:19:20,096 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 10:19:20,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 10:19:20,299 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:19:20,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:19:20,302 INFO L82 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2020-12-09 10:19:20,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 10:19:20,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625506493] [2020-12-09 10:19:20,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/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 10:19:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:19:20,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 10:19:20,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:19:20,655 WARN L197 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-12-09 10:19:20,656 INFO L348 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2020-12-09 10:19:20,656 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 21 treesize of output 101 [2020-12-09 10:19:20,664 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 10:19:20,777 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2020-12-09 10:19:20,777 INFO L625 ElimStorePlain]: treesize reduction 50, result has 53.7 percent of original size [2020-12-09 10:19:20,783 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 10:19:20,783 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:11 [2020-12-09 10:19:20,800 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 10:19:20,800 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 10:19:20,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625506493] [2020-12-09 10:19:20,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:19:20,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 10:19:20,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368516833] [2020-12-09 10:19:20,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:19:20,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 10:19:20,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:19:20,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:19:20,802 INFO L87 Difference]: Start difference. First operand 148 states and 172 transitions. Second operand 4 states. [2020-12-09 10:19:21,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:19:21,119 INFO L93 Difference]: Finished difference Result 334 states and 378 transitions. [2020-12-09 10:19:21,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:19:21,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-12-09 10:19:21,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:19:21,123 INFO L225 Difference]: With dead ends: 334 [2020-12-09 10:19:21,123 INFO L226 Difference]: Without dead ends: 334 [2020-12-09 10:19:21,123 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:19:21,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-12-09 10:19:21,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 210. [2020-12-09 10:19:21,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-12-09 10:19:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 272 transitions. [2020-12-09 10:19:21,138 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 272 transitions. Word has length 4 [2020-12-09 10:19:21,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:19:21,138 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 272 transitions. [2020-12-09 10:19:21,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:19:21,138 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 272 transitions. [2020-12-09 10:19:21,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 10:19:21,138 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:19:21,138 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 10:19:21,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 10:19:21,341 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:19:21,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:19:21,343 INFO L82 PathProgramCache]: Analyzing trace with hash 28698698, now seen corresponding path program 1 times [2020-12-09 10:19:21,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 10:19:21,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752674894] [2020-12-09 10:19:21,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/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 10:19:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:19:21,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-09 10:19:21,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:19:21,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 10:19:21,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 10:19:21,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 10:19:21,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 10:19:21,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 10:19:21,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 10:19:21,784 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 47 [2020-12-09 10:19:21,784 INFO L348 Elim1Store]: treesize reduction 322, result has 20.7 percent of original size [2020-12-09 10:19:21,784 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 190 treesize of output 242 [2020-12-09 10:19:21,792 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-12-09 10:19:21,792 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:21,792 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-12-09 10:19:21,793 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:21,795 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 1] term [2020-12-09 10:19:21,795 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:21,796 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 2, 3, 1] term [2020-12-09 10:19:21,797 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:21,799 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 10:19:21,915 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2020-12-09 10:19:21,916 INFO L625 ElimStorePlain]: treesize reduction 12, result has 91.7 percent of original size [2020-12-09 10:19:21,975 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 10:19:21,976 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 65 [2020-12-09 10:19:21,978 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 10:19:22,112 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2020-12-09 10:19:22,113 INFO L625 ElimStorePlain]: treesize reduction 24, result has 83.3 percent of original size [2020-12-09 10:19:22,127 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 10:19:22,131 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 10:19:22,135 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 10:19:22,139 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 10:19:22,143 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 13 disjuncts [2020-12-09 10:19:22,191 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-09 10:19:22,192 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:122, output treesize:122 [2020-12-09 10:19:22,197 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 10:19:22,199 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 10:19:22,202 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 10:19:22,204 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 10:19:22,206 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 13 disjuncts [2020-12-09 10:19:22,277 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 10:19:22,280 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 10:19:22,282 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 10:19:22,285 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 10:19:22,287 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 13 disjuncts [2020-12-09 10:19:22,557 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 51 [2020-12-09 10:19:22,606 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 51 treesize of output 27 [2020-12-09 10:19:22,608 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 10:19:22,653 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 10:19:22,659 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-12-09 10:19:22,659 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:98, output treesize:69 [2020-12-09 10:19:22,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 10:19:22,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 10:19:22,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752674894] [2020-12-09 10:19:22,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:19:22,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:19:22,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060857725] [2020-12-09 10:19:22,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:19:22,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 10:19:22,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:19:22,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:19:22,707 INFO L87 Difference]: Start difference. First operand 210 states and 272 transitions. Second operand 5 states. [2020-12-09 10:19:24,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:19:24,272 INFO L93 Difference]: Finished difference Result 436 states and 552 transitions. [2020-12-09 10:19:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 10:19:24,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2020-12-09 10:19:24,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:19:24,274 INFO L225 Difference]: With dead ends: 436 [2020-12-09 10:19:24,275 INFO L226 Difference]: Without dead ends: 436 [2020-12-09 10:19:24,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 10:19:24,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2020-12-09 10:19:24,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 262. [2020-12-09 10:19:24,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2020-12-09 10:19:24,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 356 transitions. [2020-12-09 10:19:24,291 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 356 transitions. Word has length 5 [2020-12-09 10:19:24,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:19:24,291 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 356 transitions. [2020-12-09 10:19:24,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:19:24,291 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 356 transitions. [2020-12-09 10:19:24,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 10:19:24,292 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:19:24,292 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 10:19:24,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 10:19:24,494 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:19:24,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:19:24,495 INFO L82 PathProgramCache]: Analyzing trace with hash 889659685, now seen corresponding path program 1 times [2020-12-09 10:19:24,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 10:19:24,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253792639] [2020-12-09 10:19:24,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/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 10:19:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:19:24,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 10:19:24,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:19:24,645 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_45|], 12=[|v_#valid_77|]} [2020-12-09 10:19:24,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 10:19:24,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 10:19:24,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 10:19:24,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 10:19:24,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 10:19:24,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 10:19:24,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 10:19:24,935 WARN L197 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2020-12-09 10:19:24,935 INFO L348 Elim1Store]: treesize reduction 48, result has 70.0 percent of original size [2020-12-09 10:19:24,936 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 117 [2020-12-09 10:19:24,939 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 10:19:25,152 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2020-12-09 10:19:25,153 INFO L625 ElimStorePlain]: treesize reduction 60, result has 71.6 percent of original size [2020-12-09 10:19:25,189 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 10:19:25,190 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 182 [2020-12-09 10:19:25,192 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 1] term [2020-12-09 10:19:25,192 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:25,193 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-12-09 10:19:25,193 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:25,194 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 5, 2, 1] term [2020-12-09 10:19:25,194 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:25,196 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 5, 3, 5, 2, 4, 1] term [2020-12-09 10:19:25,196 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:25,197 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-12-09 10:19:25,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:25,200 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 10:19:25,441 WARN L197 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2020-12-09 10:19:25,442 INFO L625 ElimStorePlain]: treesize reduction 287, result has 31.7 percent of original size [2020-12-09 10:19:25,455 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 10:19:25,461 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 10:19:25,461 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2020-12-09 10:19:25,462 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2020-12-09 10:19:25,627 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2020-12-09 10:19:25,627 INFO L625 ElimStorePlain]: treesize reduction 6, result has 95.0 percent of original size [2020-12-09 10:19:25,630 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 10:19:25,634 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:25,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:25,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 10:19:25,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,643 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:25,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 10:19:25,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:25,650 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-09 10:19:25,651 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:116, output treesize:117 [2020-12-09 10:19:25,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 10:19:25,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:25,657 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,657 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:25,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 10:19:25,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:25,663 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 10:19:25,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:25,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,756 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,758 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 10:19:25,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:25,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:25,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 10:19:25,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:25,775 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:25,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 10:19:25,972 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2020-12-09 10:19:26,017 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:26,023 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:26,029 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 1] term [2020-12-09 10:19:26,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:26,058 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 10:19:26,059 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 10:19:26,242 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2020-12-09 10:19:26,242 INFO L625 ElimStorePlain]: treesize reduction 32, result has 79.1 percent of original size [2020-12-09 10:19:26,253 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 10:19:26,254 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 10:19:26,331 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 10:19:26,337 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 33 treesize of output 17 [2020-12-09 10:19:26,339 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-09 10:19:26,404 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 10:19:26,416 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 10:19:26,417 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-09 10:19:26,471 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 10:19:26,474 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2020-12-09 10:19:26,474 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:164, output treesize:79 [2020-12-09 10:19:26,559 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 10:19:26,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 10:19:26,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253792639] [2020-12-09 10:19:26,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:19:26,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:19:26,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177829286] [2020-12-09 10:19:26,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:19:26,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 10:19:26,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:19:26,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:19:26,560 INFO L87 Difference]: Start difference. First operand 262 states and 356 transitions. Second operand 5 states. [2020-12-09 10:19:26,833 WARN L197 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2020-12-09 10:19:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:19:27,718 INFO L93 Difference]: Finished difference Result 388 states and 466 transitions. [2020-12-09 10:19:27,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 10:19:27,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-12-09 10:19:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:19:27,721 INFO L225 Difference]: With dead ends: 388 [2020-12-09 10:19:27,721 INFO L226 Difference]: Without dead ends: 388 [2020-12-09 10:19:27,721 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 10:19:27,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2020-12-09 10:19:27,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 262. [2020-12-09 10:19:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2020-12-09 10:19:27,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 352 transitions. [2020-12-09 10:19:27,728 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 352 transitions. Word has length 6 [2020-12-09 10:19:27,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:19:27,728 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 352 transitions. [2020-12-09 10:19:27,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:19:27,728 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 352 transitions. [2020-12-09 10:19:27,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 10:19:27,729 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:19:27,729 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:19:27,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 10:19:27,930 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:19:27,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:19:27,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1809646508, now seen corresponding path program 1 times [2020-12-09 10:19:27,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 10:19:27,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137636314] [2020-12-09 10:19:27,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/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 10:19:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:19:28,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 10:19:28,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:19:28,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 10:19:28,231 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 33 [2020-12-09 10:19:28,231 INFO L348 Elim1Store]: treesize reduction 336, result has 15.2 percent of original size [2020-12-09 10:19:28,231 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 64 treesize of output 102 [2020-12-09 10:19:28,234 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 10:19:28,330 INFO L625 ElimStorePlain]: treesize reduction 34, result has 72.4 percent of original size [2020-12-09 10:19:28,341 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 10:19:28,341 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2020-12-09 10:19:28,342 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-09 10:19:28,418 INFO L625 ElimStorePlain]: treesize reduction 6, result has 92.8 percent of original size [2020-12-09 10:19:28,420 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 10:19:28,421 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 10:19:28,422 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 10:19:28,423 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 10:19:28,424 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 10:19:28,424 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 10 disjuncts [2020-12-09 10:19:28,430 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-12-09 10:19:28,430 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:58, output treesize:79 [2020-12-09 10:19:28,432 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 10:19:28,433 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 10:19:28,433 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 10:19:28,434 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 10:19:28,435 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 10:19:28,435 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 10 disjuncts [2020-12-09 10:19:28,467 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 10:19:28,467 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 10:19:28,468 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 10:19:28,469 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 10:19:28,470 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 10:19:28,471 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 10 disjuncts [2020-12-09 10:19:28,652 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 10:19:28,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 10:19:28,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137636314] [2020-12-09 10:19:28,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:19:28,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 10:19:28,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094010336] [2020-12-09 10:19:28,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:19:28,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 10:19:28,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:19:28,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:19:28,653 INFO L87 Difference]: Start difference. First operand 262 states and 352 transitions. Second operand 4 states. [2020-12-09 10:19:29,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:19:29,217 INFO L93 Difference]: Finished difference Result 338 states and 430 transitions. [2020-12-09 10:19:29,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:19:29,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-12-09 10:19:29,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:19:29,219 INFO L225 Difference]: With dead ends: 338 [2020-12-09 10:19:29,219 INFO L226 Difference]: Without dead ends: 338 [2020-12-09 10:19:29,219 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:19:29,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-12-09 10:19:29,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 281. [2020-12-09 10:19:29,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2020-12-09 10:19:29,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 384 transitions. [2020-12-09 10:19:29,225 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 384 transitions. Word has length 7 [2020-12-09 10:19:29,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:19:29,225 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 384 transitions. [2020-12-09 10:19:29,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:19:29,225 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 384 transitions. [2020-12-09 10:19:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 10:19:29,225 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:19:29,225 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:19:29,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 10:19:29,427 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:19:29,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:19:29,428 INFO L82 PathProgramCache]: Analyzing trace with hash 264466951, now seen corresponding path program 1 times [2020-12-09 10:19:29,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 10:19:29,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290094969] [2020-12-09 10:19:29,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/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 10:19:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:19:29,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 10:19:29,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:19:29,527 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_46|], 4=[|v_#valid_79|]} [2020-12-09 10:19:29,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 10:19:29,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 10:19:29,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 10:19:29,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 10:19:29,800 WARN L197 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2020-12-09 10:19:29,800 INFO L348 Elim1Store]: treesize reduction 108, result has 47.1 percent of original size [2020-12-09 10:19:29,801 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2020-12-09 10:19:29,803 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 10:19:29,933 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-12-09 10:19:29,933 INFO L625 ElimStorePlain]: treesize reduction 50, result has 65.0 percent of original size [2020-12-09 10:19:29,944 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 39 treesize of output 37 [2020-12-09 10:19:29,946 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-09 10:19:30,082 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2020-12-09 10:19:30,082 INFO L625 ElimStorePlain]: treesize reduction 22, result has 80.0 percent of original size [2020-12-09 10:19:30,089 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 10:19:30,093 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 10:19:30,094 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2020-12-09 10:19:30,094 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2020-12-09 10:19:30,238 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2020-12-09 10:19:30,238 INFO L625 ElimStorePlain]: treesize reduction 6, result has 92.5 percent of original size [2020-12-09 10:19:30,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:19:30,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:19:30,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,242 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-09 10:19:30,245 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:19:30,245 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,246 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,246 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,247 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,247 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 10:19:30,249 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,249 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,250 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,250 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,251 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,251 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:30,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:30,255 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,256 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,257 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:30,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,262 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:19:30,264 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,264 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:19:30,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,267 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,267 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:19:30,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,273 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:19:30,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:19:30,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:19:30,278 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,278 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,279 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,280 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,280 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,282 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,284 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:19:30,284 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:19:30,284 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,285 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,286 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,286 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,287 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,287 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 10:19:30,288 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:19:30,288 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,290 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,290 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,290 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 10:19:30,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,293 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,293 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:19:30,293 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,294 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:30,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,296 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:19:30,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:30,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,304 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,305 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 10:19:30,306 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,306 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,307 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:30,309 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,310 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,310 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 10:19:30,313 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-12-09 10:19:30,313 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:60, output treesize:74 [2020-12-09 10:19:30,315 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:19:30,315 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:19:30,316 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,316 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,316 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,317 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,317 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,318 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,318 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,318 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-09 10:19:30,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:19:30,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,321 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,321 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,322 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 10:19:30,322 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,322 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,323 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,323 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,324 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,324 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,325 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:30,325 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,325 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,326 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,327 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,327 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:30,328 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,328 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:30,332 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,332 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,332 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:19:30,334 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,334 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:19:30,336 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,337 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,337 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,338 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,338 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,338 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:19:30,340 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:19:30,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:19:30,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:19:30,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,347 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,347 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,347 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,348 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:19:30,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:19:30,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,351 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,351 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,353 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 10:19:30,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:19:30,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,356 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,356 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,357 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 10:19:30,359 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,359 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,360 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:19:30,360 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,361 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:30,362 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,362 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,363 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:19:30,364 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,364 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,364 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:30,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,367 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,367 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,368 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 10:19:30,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:30,371 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,372 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,372 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 10:19:30,393 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:19:30,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:19:30,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,395 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,395 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,395 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,397 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,397 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-09 10:19:30,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:19:30,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,400 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,400 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,401 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,401 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 10:19:30,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:19:30,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,403 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,403 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:30,405 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,405 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,405 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:30,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:19:30,411 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,411 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:19:30,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,414 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,415 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,415 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,416 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,416 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 10:19:30,418 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,418 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,420 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 10:19:30,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:19:30,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:30,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:30,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:19:30,438 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:19:30,438 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:19:30,438 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,440 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,440 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 10:19:30,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:19:30,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 10:19:30,445 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,445 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,446 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,446 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,447 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 10:19:30,447 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,448 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 10:19:30,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,453 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,453 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:30,455 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:30,456 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,456 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:19:30,456 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,457 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:30,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:30,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:19:30,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:19:30,461 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:19:30,664 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 35 [2020-12-09 10:19:30,763 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 10:19:30,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 10:19:30,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290094969] [2020-12-09 10:19:30,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:19:30,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 10:19:30,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021312248] [2020-12-09 10:19:30,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:19:30,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 10:19:30,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:19:30,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:19:30,764 INFO L87 Difference]: Start difference. First operand 281 states and 384 transitions. Second operand 4 states. [2020-12-09 10:19:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:19:31,342 INFO L93 Difference]: Finished difference Result 342 states and 441 transitions. [2020-12-09 10:19:31,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:19:31,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-12-09 10:19:31,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:19:31,345 INFO L225 Difference]: With dead ends: 342 [2020-12-09 10:19:31,345 INFO L226 Difference]: Without dead ends: 342 [2020-12-09 10:19:31,345 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:19:31,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2020-12-09 10:19:31,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 280. [2020-12-09 10:19:31,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-12-09 10:19:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 382 transitions. [2020-12-09 10:19:31,350 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 382 transitions. Word has length 8 [2020-12-09 10:19:31,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:19:31,351 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 382 transitions. [2020-12-09 10:19:31,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:19:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 382 transitions. [2020-12-09 10:19:31,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 10:19:31,351 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:19:31,351 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:19:31,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 10:19:31,553 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:19:31,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:19:31,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1118688979, now seen corresponding path program 1 times [2020-12-09 10:19:31,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 10:19:31,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748835090] [2020-12-09 10:19:31,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/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 10:19:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:19:31,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 10:19:31,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:19:31,892 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-12-09 10:19:31,892 INFO L348 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2020-12-09 10:19:31,892 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 21 treesize of output 101 [2020-12-09 10:19:31,894 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 10:19:31,978 INFO L625 ElimStorePlain]: treesize reduction 50, result has 53.7 percent of original size [2020-12-09 10:19:31,980 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 10:19:31,981 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:11 [2020-12-09 10:19:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:19:32,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 10:19:32,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:19:32,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748835090] [2020-12-09 10:19:32,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1960814298] [2020-12-09 10:19:32,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt [2020-12-09 10:19:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:19:32,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 10:19:32,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:19:32,620 WARN L197 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-12-09 10:19:32,620 INFO L348 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2020-12-09 10:19:32,621 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 21 treesize of output 101 [2020-12-09 10:19:32,623 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 10:19:32,703 INFO L625 ElimStorePlain]: treesize reduction 50, result has 53.7 percent of original size [2020-12-09 10:19:32,705 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 10:19:32,706 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:11 [2020-12-09 10:19:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:19:32,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 10:19:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:19:32,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615290845] [2020-12-09 10:19:32,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 10:19:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:19:32,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 10:19:32,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:19:33,034 WARN L197 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2020-12-09 10:19:33,034 INFO L348 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2020-12-09 10:19:33,034 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 21 treesize of output 101 [2020-12-09 10:19:33,036 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 10:19:33,116 INFO L625 ElimStorePlain]: treesize reduction 50, result has 53.7 percent of original size [2020-12-09 10:19:33,118 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 10:19:33,118 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:11 [2020-12-09 10:19:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:19:33,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 10:19:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:19:33,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 10:19:33,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3, 3, 3, 4] total 8 [2020-12-09 10:19:33,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045349323] [2020-12-09 10:19:33,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 10:19:33,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 10:19:33,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 10:19:33,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-12-09 10:19:33,378 INFO L87 Difference]: Start difference. First operand 280 states and 382 transitions. Second operand 10 states. [2020-12-09 10:19:33,608 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2020-12-09 10:19:34,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:19:34,947 INFO L93 Difference]: Finished difference Result 757 states and 919 transitions. [2020-12-09 10:19:34,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 10:19:34,948 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2020-12-09 10:19:34,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:19:34,951 INFO L225 Difference]: With dead ends: 757 [2020-12-09 10:19:34,951 INFO L226 Difference]: Without dead ends: 757 [2020-12-09 10:19:34,951 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2020-12-09 10:19:34,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2020-12-09 10:19:34,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 395. [2020-12-09 10:19:34,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-12-09 10:19:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 564 transitions. [2020-12-09 10:19:34,960 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 564 transitions. Word has length 12 [2020-12-09 10:19:34,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:19:34,960 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 564 transitions. [2020-12-09 10:19:34,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 10:19:34,960 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 564 transitions. [2020-12-09 10:19:34,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 10:19:34,960 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:19:34,960 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:19:35,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt,8 mathsat -unsat_core_generation=3,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 10:19:35,563 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2020-12-09 10:19:35,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:19:35,564 INFO L82 PathProgramCache]: Analyzing trace with hash -319620029, now seen corresponding path program 1 times [2020-12-09 10:19:35,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 10:19:35,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546478603] [2020-12-09 10:19:35,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/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 10:19:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:19:35,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 10:19:35,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:19:35,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 10:19:35,898 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 44 [2020-12-09 10:19:35,898 INFO L348 Elim1Store]: treesize reduction 429, result has 15.7 percent of original size [2020-12-09 10:19:35,899 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 9 case distinctions, treesize of input 133 treesize of output 183 [2020-12-09 10:19:35,900 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2020-12-09 10:19:35,901 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:35,901 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 1] term [2020-12-09 10:19:35,901 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:35,904 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 10:19:36,052 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2020-12-09 10:19:36,053 INFO L625 ElimStorePlain]: treesize reduction 106, result has 55.8 percent of original size [2020-12-09 10:19:36,070 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 10:19:36,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2020-12-09 10:19:36,071 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-09 10:19:36,201 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2020-12-09 10:19:36,202 INFO L625 ElimStorePlain]: treesize reduction 6, result has 95.3 percent of original size [2020-12-09 10:19:36,204 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 10:19:36,205 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 10:19:36,206 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 10:19:36,206 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 10:19:36,207 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 12 disjuncts [2020-12-09 10:19:36,219 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-09 10:19:36,219 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:102, output treesize:124 [2020-12-09 10:19:36,223 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 10:19:36,224 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 10:19:36,225 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 10:19:36,225 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 10:19:36,226 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 12 disjuncts [2020-12-09 10:19:36,266 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 10:19:36,267 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-12-09 10:19:36,268 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 5 disjuncts [2020-12-09 10:19:36,269 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 10:19:36,269 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 12 disjuncts [2020-12-09 10:19:41,120 WARN L197 SmtUtils]: Spent 4.77 s on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2020-12-09 10:19:43,692 WARN L197 SmtUtils]: Spent 1.93 s on a formula simplification that was a NOOP. DAG size: 113 [2020-12-09 10:19:43,719 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 7, 1] term [2020-12-09 10:19:43,719 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 10:19:43,743 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 41 treesize of output 21 [2020-12-09 10:19:43,744 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 10:19:43,922 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-12-09 10:19:43,923 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 10:19:43,930 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 41 treesize of output 21 [2020-12-09 10:19:43,932 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 10:19:44,088 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-12-09 10:19:44,089 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 10:19:44,100 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 41 treesize of output 21 [2020-12-09 10:19:44,102 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-09 10:19:44,257 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-09 10:19:44,257 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 10:19:44,263 INFO L547 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-2 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2020-12-09 10:19:44,263 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:276, output treesize:209 [2020-12-09 10:19:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:19:44,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 10:19:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:19:44,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546478603] [2020-12-09 10:19:44,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1373334079] [2020-12-09 10:19:44,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt [2020-12-09 10:19:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:19:44,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 10:19:44,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:19:45,180 WARN L197 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 53 [2020-12-09 10:19:45,180 INFO L348 Elim1Store]: treesize reduction 591, result has 15.0 percent of original size [2020-12-09 10:19:45,180 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 675 treesize of output 729 [2020-12-09 10:19:45,184 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-12-09 10:19:45,184 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:45,185 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-12-09 10:19:45,185 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:45,186 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 3, 2, 2, 1] term [2020-12-09 10:19:45,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:45,187 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 3, 2, 2, 1] term [2020-12-09 10:19:45,187 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:45,187 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-12-09 10:19:45,187 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:45,188 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 3, 3, 3, 3, 2, 2, 1] term [2020-12-09 10:19:45,188 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:45,189 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 2, 1] term [2020-12-09 10:19:45,189 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:19:45,189 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 2, 1] term [2020-12-09 10:19:45,189 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:45,190 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 5, 3, 3, 3, 3, 2, 2, 1] term [2020-12-09 10:19:45,190 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:19:45,200 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 10:19:45,401 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2020-12-09 10:19:45,402 INFO L625 ElimStorePlain]: treesize reduction 311, result has 33.1 percent of original size [2020-12-09 10:19:45,404 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 10:19:45,404 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 10:19:45,405 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 10:19:45,406 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 12 disjuncts [2020-12-09 10:19:45,409 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-09 10:19:45,409 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:122, output treesize:156 [2020-12-09 10:19:45,410 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 10:19:45,411 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 10:19:45,412 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 10:19:45,412 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 12 disjuncts [2020-12-09 10:19:45,512 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 10:19:45,513 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 10:19:45,514 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 6 disjuncts [2020-12-09 10:19:45,515 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 12 disjuncts [2020-12-09 10:19:49,893 WARN L197 SmtUtils]: Spent 4.24 s on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2020-12-09 10:19:50,894 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-09 10:19:50,917 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 9, 1] term [2020-12-09 10:19:50,917 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 10:19:50,927 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 10:19:50,949 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 40 [2020-12-09 10:19:50,951 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 10:19:51,123 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-12-09 10:19:51,124 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 10:19:51,133 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 40 [2020-12-09 10:19:51,134 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 10:19:51,287 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-12-09 10:19:51,288 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 10:19:51,295 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 40 [2020-12-09 10:19:51,297 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 10:19:51,444 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-09 10:19:51,444 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 10:19:51,453 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2020-12-09 10:19:51,453 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:340, output treesize:219 [2020-12-09 10:19:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:19:51,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 10:19:51,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:19:51,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520307238] [2020-12-09 10:19:51,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14d6165d-9497-4f75-8499-36acc3fe1f90/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 10:19:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 10:19:51,818 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 10:19:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 10:19:51,859 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 10:19:52,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 mathsat -unsat_core_generation=3,12 cvc4 --incremental --print-success --lang smt [2020-12-09 10:19:52,496 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: Tracecheck IpTcStrategyModuleMathsat [546478603] said UNSAT, interpolant generator IpTcStrategyModuleZ3 [520307238] failed with TRACE_FEASIBLE at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:326) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 10:19:52,504 INFO L168 Benchmark]: Toolchain (without parser) took 34434.18 ms. Allocated memory was 56.6 MB in the beginning and 100.7 MB in the end (delta: 44.0 MB). Free memory was 34.1 MB in the beginning and 72.6 MB in the end (delta: -38.5 MB). Peak memory consumption was 4.7 MB. Max. memory is 16.1 GB. [2020-12-09 10:19:52,504 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 56.6 MB. Free memory was 38.8 MB in the beginning and 38.8 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 10:19:52,504 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.87 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 33.9 MB in the beginning and 46.3 MB in the end (delta: -12.4 MB). Peak memory consumption was 11.9 MB. Max. memory is 16.1 GB. [2020-12-09 10:19:52,504 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.90 ms. Allocated memory is still 69.2 MB. Free memory was 46.3 MB in the beginning and 43.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 10:19:52,505 INFO L168 Benchmark]: Boogie Preprocessor took 30.35 ms. Allocated memory is still 69.2 MB. Free memory was 43.5 MB in the beginning and 41.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 10:19:52,505 INFO L168 Benchmark]: RCFGBuilder took 664.92 ms. Allocated memory is still 69.2 MB. Free memory was 41.3 MB in the beginning and 31.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 11.5 MB. Max. memory is 16.1 GB. [2020-12-09 10:19:52,505 INFO L168 Benchmark]: TraceAbstraction took 33324.67 ms. Allocated memory was 69.2 MB in the beginning and 100.7 MB in the end (delta: 31.5 MB). Free memory was 30.8 MB in the beginning and 72.6 MB in the end (delta: -41.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 10:19:52,507 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 56.6 MB. Free memory was 38.8 MB in the beginning and 38.8 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 368.87 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 33.9 MB in the beginning and 46.3 MB in the end (delta: -12.4 MB). Peak memory consumption was 11.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.90 ms. Allocated memory is still 69.2 MB. Free memory was 46.3 MB in the beginning and 43.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 30.35 ms. Allocated memory is still 69.2 MB. Free memory was 43.5 MB in the beginning and 41.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 664.92 ms. Allocated memory is still 69.2 MB. Free memory was 41.3 MB in the beginning and 31.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 11.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 33324.67 ms. Allocated memory was 69.2 MB in the beginning and 100.7 MB in the end (delta: 31.5 MB). Free memory was 30.8 MB in the beginning and 72.6 MB in the end (delta: -41.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: Tracecheck IpTcStrategyModuleMathsat [546478603] said UNSAT, interpolant generator IpTcStrategyModuleZ3 [520307238] failed with TRACE_FEASIBLE de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: Tracecheck IpTcStrategyModuleMathsat [546478603] said UNSAT, interpolant generator IpTcStrategyModuleZ3 [520307238] failed with TRACE_FEASIBLE: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:326) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...