./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/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 86beb7e463e80bf4cd7303ba718fa4bc3c1db625 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/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 86beb7e463e80bf4cd7303ba718fa4bc3c1db625 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 11:06:57,185 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 11:06:57,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 11:06:57,222 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 11:06:57,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 11:06:57,224 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 11:06:57,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 11:06:57,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 11:06:57,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 11:06:57,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 11:06:57,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 11:06:57,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 11:06:57,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 11:06:57,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 11:06:57,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 11:06:57,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 11:06:57,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 11:06:57,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 11:06:57,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 11:06:57,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 11:06:57,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 11:06:57,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 11:06:57,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 11:06:57,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 11:06:57,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 11:06:57,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 11:06:57,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 11:06:57,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 11:06:57,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 11:06:57,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 11:06:57,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 11:06:57,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 11:06:57,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 11:06:57,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 11:06:57,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 11:06:57,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 11:06:57,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 11:06:57,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 11:06:57,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 11:06:57,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 11:06:57,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 11:06:57,266 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-12-09 11:06:57,287 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 11:06:57,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 11:06:57,288 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 11:06:57,289 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 11:06:57,289 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 11:06:57,289 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 11:06:57,289 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 11:06:57,289 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 11:06:57,289 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 11:06:57,289 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 11:06:57,289 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 11:06:57,290 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 11:06:57,290 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 11:06:57,290 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 11:06:57,290 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 11:06:57,291 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 11:06:57,291 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 11:06:57,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 11:06:57,291 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 11:06:57,291 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 11:06:57,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 11:06:57,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 11:06:57,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 11:06:57,292 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 11:06:57,292 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 11:06:57,292 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 11:06:57,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 11:06:57,292 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 11:06:57,292 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 11:06:57,292 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 11:06:57,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 11:06:57,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 11:06:57,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 11:06:57,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 11:06:57,293 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 11:06:57,294 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 11:06:57,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 11:06:57,294 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 11:06:57,294 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 11:06:57,294 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_1f051525-3842-4a59-871e-64218cf7a913/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_1f051525-3842-4a59-871e-64218cf7a913/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 -> 86beb7e463e80bf4cd7303ba718fa4bc3c1db625 [2020-12-09 11:06:57,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 11:06:57,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 11:06:57,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 11:06:57,496 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 11:06:57,497 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 11:06:57,498 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2020-12-09 11:06:57,547 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/data/9969d29a6/8234bbe2c6cc49b8bd06835db0c2faad/FLAG1342f595c [2020-12-09 11:06:57,987 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 11:06:57,988 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2020-12-09 11:06:57,999 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/data/9969d29a6/8234bbe2c6cc49b8bd06835db0c2faad/FLAG1342f595c [2020-12-09 11:06:58,348 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/data/9969d29a6/8234bbe2c6cc49b8bd06835db0c2faad [2020-12-09 11:06:58,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 11:06:58,353 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 11:06:58,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 11:06:58,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 11:06:58,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 11:06:58,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:06:58" (1/1) ... [2020-12-09 11:06:58,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d8c98f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:06:58, skipping insertion in model container [2020-12-09 11:06:58,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:06:58" (1/1) ... [2020-12-09 11:06:58,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 11:06:58,391 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 11:06:58,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 11:06:58,580 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 11:06:58,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 11:06:58,644 INFO L208 MainTranslator]: Completed translation [2020-12-09 11:06:58,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:06:58 WrapperNode [2020-12-09 11:06:58,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 11:06:58,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 11:06:58,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 11:06:58,645 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 11:06:58,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:06:58" (1/1) ... [2020-12-09 11:06:58,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:06:58" (1/1) ... [2020-12-09 11:06:58,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 11:06:58,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 11:06:58,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 11:06:58,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 11:06:58,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:06:58" (1/1) ... [2020-12-09 11:06:58,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:06:58" (1/1) ... [2020-12-09 11:06:58,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:06:58" (1/1) ... [2020-12-09 11:06:58,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:06:58" (1/1) ... [2020-12-09 11:06:58,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:06:58" (1/1) ... [2020-12-09 11:06:58,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:06:58" (1/1) ... [2020-12-09 11:06:58,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:06:58" (1/1) ... [2020-12-09 11:06:58,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 11:06:58,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 11:06:58,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 11:06:58,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 11:06:58,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:06:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/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 11:06:58,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 11:06:58,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-09 11:06:58,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 11:06:58,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 11:06:58,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 11:06:58,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-09 11:06:58,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 11:06:58,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 11:06:58,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 11:06:59,177 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 11:06:59,178 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2020-12-09 11:06:59,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:06:59 BoogieIcfgContainer [2020-12-09 11:06:59,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 11:06:59,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 11:06:59,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 11:06:59,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 11:06:59,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 11:06:58" (1/3) ... [2020-12-09 11:06:59,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f136ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:06:59, skipping insertion in model container [2020-12-09 11:06:59,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:06:58" (2/3) ... [2020-12-09 11:06:59,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f136ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:06:59, skipping insertion in model container [2020-12-09 11:06:59,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:06:59" (3/3) ... [2020-12-09 11:06:59,185 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2020-12-09 11:06:59,195 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 11:06:59,197 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2020-12-09 11:06:59,205 INFO L253 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2020-12-09 11:06:59,222 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 11:06:59,222 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 11:06:59,222 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 11:06:59,222 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 11:06:59,222 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 11:06:59,222 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 11:06:59,222 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 11:06:59,222 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 11:06:59,235 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2020-12-09 11:06:59,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 11:06:59,240 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:06:59,241 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 11:06:59,241 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:06:59,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:06:59,245 INFO L82 PathProgramCache]: Analyzing trace with hash 153954, now seen corresponding path program 1 times [2020-12-09 11:06:59,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:06:59,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382449804] [2020-12-09 11:06:59,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:06:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:06:59,391 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 11:06:59,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382449804] [2020-12-09 11:06:59,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:06:59,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 11:06:59,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157781630] [2020-12-09 11:06:59,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 11:06:59,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:06:59,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 11:06:59,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 11:06:59,409 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2020-12-09 11:06:59,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:06:59,533 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2020-12-09 11:06:59,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 11:06:59,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2020-12-09 11:06:59,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:06:59,544 INFO L225 Difference]: With dead ends: 101 [2020-12-09 11:06:59,544 INFO L226 Difference]: Without dead ends: 100 [2020-12-09 11:06:59,546 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 11:06:59,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-12-09 11:06:59,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 73. [2020-12-09 11:06:59,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-12-09 11:06:59,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2020-12-09 11:06:59,582 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 3 [2020-12-09 11:06:59,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:06:59,582 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2020-12-09 11:06:59,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 11:06:59,582 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2020-12-09 11:06:59,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 11:06:59,583 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:06:59,583 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 11:06:59,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 11:06:59,584 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:06:59,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:06:59,585 INFO L82 PathProgramCache]: Analyzing trace with hash 153955, now seen corresponding path program 1 times [2020-12-09 11:06:59,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:06:59,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328647638] [2020-12-09 11:06:59,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:06:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:06:59,648 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 11:06:59,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328647638] [2020-12-09 11:06:59,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:06:59,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 11:06:59,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508810008] [2020-12-09 11:06:59,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 11:06:59,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:06:59,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 11:06:59,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 11:06:59,651 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 4 states. [2020-12-09 11:06:59,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:06:59,840 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2020-12-09 11:06:59,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 11:06:59,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2020-12-09 11:06:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:06:59,842 INFO L225 Difference]: With dead ends: 170 [2020-12-09 11:06:59,842 INFO L226 Difference]: Without dead ends: 170 [2020-12-09 11:06:59,843 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 11:06:59,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-12-09 11:06:59,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 79. [2020-12-09 11:06:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-09 11:06:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2020-12-09 11:06:59,850 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 3 [2020-12-09 11:06:59,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:06:59,850 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2020-12-09 11:06:59,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 11:06:59,850 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2020-12-09 11:06:59,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 11:06:59,850 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:06:59,850 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 11:06:59,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 11:06:59,851 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:06:59,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:06:59,851 INFO L82 PathProgramCache]: Analyzing trace with hash 4772554, now seen corresponding path program 1 times [2020-12-09 11:06:59,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:06:59,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137276063] [2020-12-09 11:06:59,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:06:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:06:59,874 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 11:06:59,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137276063] [2020-12-09 11:06:59,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:06:59,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 11:06:59,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698619701] [2020-12-09 11:06:59,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 11:06:59,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:06:59,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 11:06:59,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 11:06:59,875 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 3 states. [2020-12-09 11:06:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:06:59,926 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2020-12-09 11:06:59,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 11:06:59,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-12-09 11:06:59,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:06:59,927 INFO L225 Difference]: With dead ends: 92 [2020-12-09 11:06:59,927 INFO L226 Difference]: Without dead ends: 92 [2020-12-09 11:06:59,928 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 11:06:59,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-12-09 11:06:59,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 75. [2020-12-09 11:06:59,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-09 11:06:59,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2020-12-09 11:06:59,932 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 4 [2020-12-09 11:06:59,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:06:59,932 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2020-12-09 11:06:59,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 11:06:59,933 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2020-12-09 11:06:59,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 11:06:59,933 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:06:59,933 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 11:06:59,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 11:06:59,933 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:06:59,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:06:59,934 INFO L82 PathProgramCache]: Analyzing trace with hash 4772555, now seen corresponding path program 1 times [2020-12-09 11:06:59,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:06:59,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306976554] [2020-12-09 11:06:59,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:06:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:06:59,959 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 11:06:59,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306976554] [2020-12-09 11:06:59,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:06:59,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 11:06:59,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929596044] [2020-12-09 11:06:59,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 11:06:59,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:06:59,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 11:06:59,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 11:06:59,960 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 3 states. [2020-12-09 11:06:59,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:06:59,998 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2020-12-09 11:06:59,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 11:06:59,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-12-09 11:06:59,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:06:59,999 INFO L225 Difference]: With dead ends: 72 [2020-12-09 11:06:59,999 INFO L226 Difference]: Without dead ends: 72 [2020-12-09 11:07:00,000 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 11:07:00,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-12-09 11:07:00,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2020-12-09 11:07:00,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-09 11:07:00,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2020-12-09 11:07:00,004 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 4 [2020-12-09 11:07:00,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:07:00,004 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2020-12-09 11:07:00,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 11:07:00,004 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2020-12-09 11:07:00,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 11:07:00,004 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:07:00,004 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:07:00,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 11:07:00,005 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:07:00,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:07:00,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1029578956, now seen corresponding path program 1 times [2020-12-09 11:07:00,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:07:00,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727209654] [2020-12-09 11:07:00,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:07:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:07:00,061 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 11:07:00,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727209654] [2020-12-09 11:07:00,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:07:00,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 11:07:00,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850655405] [2020-12-09 11:07:00,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 11:07:00,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:07:00,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 11:07:00,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 11:07:00,063 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 7 states. [2020-12-09 11:07:00,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:07:00,178 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2020-12-09 11:07:00,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 11:07:00,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-12-09 11:07:00,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:07:00,179 INFO L225 Difference]: With dead ends: 79 [2020-12-09 11:07:00,179 INFO L226 Difference]: Without dead ends: 79 [2020-12-09 11:07:00,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-09 11:07:00,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-12-09 11:07:00,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2020-12-09 11:07:00,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-12-09 11:07:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2020-12-09 11:07:00,183 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 8 [2020-12-09 11:07:00,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:07:00,183 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2020-12-09 11:07:00,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 11:07:00,183 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2020-12-09 11:07:00,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 11:07:00,184 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:07:00,184 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:07:00,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 11:07:00,184 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:07:00,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:07:00,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1029591182, now seen corresponding path program 1 times [2020-12-09 11:07:00,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:07:00,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791543275] [2020-12-09 11:07:00,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:07:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:07:00,232 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 11:07:00,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791543275] [2020-12-09 11:07:00,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:07:00,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 11:07:00,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676579392] [2020-12-09 11:07:00,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 11:07:00,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:07:00,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 11:07:00,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 11:07:00,233 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 4 states. [2020-12-09 11:07:00,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:07:00,304 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2020-12-09 11:07:00,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 11:07:00,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-12-09 11:07:00,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:07:00,305 INFO L225 Difference]: With dead ends: 91 [2020-12-09 11:07:00,306 INFO L226 Difference]: Without dead ends: 91 [2020-12-09 11:07:00,306 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 11:07:00,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-12-09 11:07:00,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 73. [2020-12-09 11:07:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-12-09 11:07:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2020-12-09 11:07:00,310 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 8 [2020-12-09 11:07:00,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:07:00,310 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2020-12-09 11:07:00,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 11:07:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2020-12-09 11:07:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 11:07:00,311 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:07:00,311 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:07:00,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 11:07:00,311 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:07:00,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:07:00,311 INFO L82 PathProgramCache]: Analyzing trace with hash -754889711, now seen corresponding path program 1 times [2020-12-09 11:07:00,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:07:00,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024479235] [2020-12-09 11:07:00,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:07:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:07:00,341 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 11:07:00,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024479235] [2020-12-09 11:07:00,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:07:00,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 11:07:00,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137027683] [2020-12-09 11:07:00,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 11:07:00,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:07:00,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 11:07:00,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 11:07:00,343 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 4 states. [2020-12-09 11:07:00,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:07:00,358 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-12-09 11:07:00,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 11:07:00,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-09 11:07:00,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:07:00,358 INFO L225 Difference]: With dead ends: 55 [2020-12-09 11:07:00,359 INFO L226 Difference]: Without dead ends: 55 [2020-12-09 11:07:00,359 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 11:07:00,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-12-09 11:07:00,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-12-09 11:07:00,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-09 11:07:00,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2020-12-09 11:07:00,361 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 12 [2020-12-09 11:07:00,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:07:00,361 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2020-12-09 11:07:00,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 11:07:00,362 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-12-09 11:07:00,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 11:07:00,362 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:07:00,362 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:07:00,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 11:07:00,362 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:07:00,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:07:00,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1928008016, now seen corresponding path program 1 times [2020-12-09 11:07:00,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:07:00,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318663748] [2020-12-09 11:07:00,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:07:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:07:00,405 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 11:07:00,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318663748] [2020-12-09 11:07:00,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:07:00,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 11:07:00,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418877345] [2020-12-09 11:07:00,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 11:07:00,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:07:00,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 11:07:00,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 11:07:00,407 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 6 states. [2020-12-09 11:07:00,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:07:00,484 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-12-09 11:07:00,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 11:07:00,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-09 11:07:00,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:07:00,485 INFO L225 Difference]: With dead ends: 52 [2020-12-09 11:07:00,485 INFO L226 Difference]: Without dead ends: 52 [2020-12-09 11:07:00,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 11:07:00,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-12-09 11:07:00,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-12-09 11:07:00,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-12-09 11:07:00,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2020-12-09 11:07:00,488 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 13 [2020-12-09 11:07:00,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:07:00,488 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2020-12-09 11:07:00,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 11:07:00,488 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-12-09 11:07:00,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 11:07:00,488 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:07:00,488 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:07:00,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 11:07:00,489 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:07:00,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:07:00,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1928008015, now seen corresponding path program 1 times [2020-12-09 11:07:00,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:07:00,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655412246] [2020-12-09 11:07:00,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:07:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:07:00,561 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 11:07:00,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655412246] [2020-12-09 11:07:00,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:07:00,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 11:07:00,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920980354] [2020-12-09 11:07:00,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 11:07:00,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:07:00,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 11:07:00,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 11:07:00,563 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 6 states. [2020-12-09 11:07:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:07:00,654 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2020-12-09 11:07:00,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 11:07:00,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-09 11:07:00,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:07:00,655 INFO L225 Difference]: With dead ends: 51 [2020-12-09 11:07:00,655 INFO L226 Difference]: Without dead ends: 51 [2020-12-09 11:07:00,655 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 11:07:00,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-12-09 11:07:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-12-09 11:07:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-09 11:07:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2020-12-09 11:07:00,657 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 13 [2020-12-09 11:07:00,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:07:00,658 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2020-12-09 11:07:00,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 11:07:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2020-12-09 11:07:00,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 11:07:00,658 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:07:00,658 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:07:00,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 11:07:00,658 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:07:00,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:07:00,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1684736751, now seen corresponding path program 1 times [2020-12-09 11:07:00,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:07:00,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730102012] [2020-12-09 11:07:00,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:07:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:07:00,692 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 11:07:00,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730102012] [2020-12-09 11:07:00,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:07:00,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 11:07:00,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295349675] [2020-12-09 11:07:00,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 11:07:00,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:07:00,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 11:07:00,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 11:07:00,693 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 5 states. [2020-12-09 11:07:00,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:07:00,749 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2020-12-09 11:07:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 11:07:00,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-09 11:07:00,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:07:00,749 INFO L225 Difference]: With dead ends: 50 [2020-12-09 11:07:00,750 INFO L226 Difference]: Without dead ends: 50 [2020-12-09 11:07:00,750 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 11:07:00,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-12-09 11:07:00,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-12-09 11:07:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-12-09 11:07:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2020-12-09 11:07:00,752 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 15 [2020-12-09 11:07:00,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:07:00,753 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2020-12-09 11:07:00,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 11:07:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2020-12-09 11:07:00,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 11:07:00,753 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:07:00,753 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:07:00,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 11:07:00,754 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:07:00,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:07:00,754 INFO L82 PathProgramCache]: Analyzing trace with hash -687231616, now seen corresponding path program 1 times [2020-12-09 11:07:00,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:07:00,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916369481] [2020-12-09 11:07:00,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:07:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:07:00,802 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 11:07:00,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916369481] [2020-12-09 11:07:00,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:07:00,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 11:07:00,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450591100] [2020-12-09 11:07:00,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 11:07:00,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:07:00,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 11:07:00,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 11:07:00,803 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 5 states. [2020-12-09 11:07:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:07:00,866 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-12-09 11:07:00,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 11:07:00,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-09 11:07:00,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:07:00,866 INFO L225 Difference]: With dead ends: 49 [2020-12-09 11:07:00,867 INFO L226 Difference]: Without dead ends: 49 [2020-12-09 11:07:00,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 11:07:00,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-12-09 11:07:00,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-12-09 11:07:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-12-09 11:07:00,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2020-12-09 11:07:00,868 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 16 [2020-12-09 11:07:00,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:07:00,869 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2020-12-09 11:07:00,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 11:07:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-12-09 11:07:00,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 11:07:00,869 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:07:00,869 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:07:00,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 11:07:00,869 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:07:00,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:07:00,870 INFO L82 PathProgramCache]: Analyzing trace with hash -177383025, now seen corresponding path program 1 times [2020-12-09 11:07:00,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:07:00,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364772990] [2020-12-09 11:07:00,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:07:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:07:00,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:07:00,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364772990] [2020-12-09 11:07:00,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940673436] [2020-12-09 11:07:00,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/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 11:07:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:07:01,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 32 conjunts are in the unsatisfiable core [2020-12-09 11:07:01,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:07:01,068 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 11:07:01,069 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:07:01,076 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:07:01,076 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:07:01,077 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2020-12-09 11:07:01,135 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:07:01,136 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2020-12-09 11:07:01,137 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:07:01,158 INFO L625 ElimStorePlain]: treesize reduction 14, result has 62.2 percent of original size [2020-12-09 11:07:01,159 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:07:01,159 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2020-12-09 11:07:01,201 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 11:07:01,201 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:07:01,209 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:07:01,214 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:07:01,214 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:19 [2020-12-09 11:07:01,275 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:07:01,276 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2020-12-09 11:07:01,278 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:07:01,298 INFO L625 ElimStorePlain]: treesize reduction 26, result has 48.0 percent of original size [2020-12-09 11:07:01,300 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:07:01,301 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2020-12-09 11:07:01,399 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 11:07:01,420 INFO L348 Elim1Store]: treesize reduction 48, result has 27.3 percent of original size [2020-12-09 11:07:01,420 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 30 [2020-12-09 11:07:01,422 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:07:01,441 INFO L625 ElimStorePlain]: treesize reduction 11, result has 76.1 percent of original size [2020-12-09 11:07:01,445 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 11:07:01,445 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:32 [2020-12-09 11:07:01,525 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:07:01,526 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2020-12-09 11:07:01,527 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:07:01,532 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:07:01,534 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:07:01,534 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:11 [2020-12-09 11:07:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:07:01,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 11:07:01,589 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2020-12-09 11:07:01,590 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 11:07:01,600 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:07:01,601 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:07:01,601 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2020-12-09 11:07:01,654 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 11:07:03,676 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_arrayElimCell_7 Int) (|v_ULTIMATE.start_append_#t~malloc11.base_4| Int)) (= (select (store |c_#valid| |v_ULTIMATE.start_append_#t~malloc11.base_4| 1) v_arrayElimCell_7) 1)))) (and (or .cse0 (= c_ULTIMATE.start_append_~plist.offset |c_ULTIMATE.start_main_~#list~0.offset|)) (forall ((v_arrayElimCell_7 Int) (|v_ULTIMATE.start_append_#t~malloc11.base_4| Int)) (let ((.cse1 (store |c_#valid| |v_ULTIMATE.start_append_#t~malloc11.base_4| 1))) (or (= (select .cse1 c_ULTIMATE.start_append_~item~0.base) 1) (= (select .cse1 v_arrayElimCell_7) 1)))) (or (= |c_ULTIMATE.start_main_~#list~0.base| c_ULTIMATE.start_append_~plist.base) .cse0))) is different from false [2020-12-09 11:07:07,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2020-12-09 11:07:07,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1907514145] [2020-12-09 11:07:07,839 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2020-12-09 11:07:07,839 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 11:07:07,843 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 11:07:07,846 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 11:07:07,847 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 11:07:07,992 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 11:07:09,094 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 11:07:09,126 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 11:07:09,138 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 11:07:11,297 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 11:07:11,452 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2020-12-09 11:07:11,847 WARN L197 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 125 [2020-12-09 11:07:12,562 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2020-12-09 11:07:12,564 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 11:07:12,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 11:07:12,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 20 [2020-12-09 11:07:12,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341789182] [2020-12-09 11:07:12,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-09 11:07:12,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:07:12,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-09 11:07:12,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=772, Unknown=1, NotChecked=56, Total=930 [2020-12-09 11:07:12,565 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 21 states. [2020-12-09 11:07:13,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:07:13,042 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2020-12-09 11:07:13,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 11:07:13,043 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 16 [2020-12-09 11:07:13,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:07:13,043 INFO L225 Difference]: With dead ends: 62 [2020-12-09 11:07:13,043 INFO L226 Difference]: Without dead ends: 62 [2020-12-09 11:07:13,044 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=227, Invalid=1182, Unknown=1, NotChecked=72, Total=1482 [2020-12-09 11:07:13,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-12-09 11:07:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2020-12-09 11:07:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-12-09 11:07:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2020-12-09 11:07:13,045 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 16 [2020-12-09 11:07:13,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:07:13,046 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2020-12-09 11:07:13,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-09 11:07:13,046 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2020-12-09 11:07:13,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 11:07:13,046 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:07:13,046 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:07:13,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-09 11:07:13,248 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:07:13,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:07:13,249 INFO L82 PathProgramCache]: Analyzing trace with hash -177383024, now seen corresponding path program 1 times [2020-12-09 11:07:13,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:07:13,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622946056] [2020-12-09 11:07:13,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:07:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:07:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:07:13,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622946056] [2020-12-09 11:07:13,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650928228] [2020-12-09 11:07:13,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/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 11:07:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:07:13,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 48 conjunts are in the unsatisfiable core [2020-12-09 11:07:13,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:07:13,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:07:13,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 11:07:14,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:07:14,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1229943520] [2020-12-09 11:07:14,355 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2020-12-09 11:07:14,355 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 11:07:14,355 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 11:07:14,355 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 11:07:14,356 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 11:07:14,833 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-12-09 11:07:14,840 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-12-09 11:10:03,007 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 11:10:03,016 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 11:10:03,034 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 11:10:03,811 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 11:10:03,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 11:10:03,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 26 [2020-12-09 11:10:03,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128706835] [2020-12-09 11:10:03,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-09 11:10:03,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:10:03,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-09 11:10:03,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1246, Unknown=0, NotChecked=0, Total=1406 [2020-12-09 11:10:03,812 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 27 states. [2020-12-09 11:10:04,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:10:04,953 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2020-12-09 11:10:04,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 11:10:04,954 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 16 [2020-12-09 11:10:04,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:10:04,954 INFO L225 Difference]: With dead ends: 78 [2020-12-09 11:10:04,954 INFO L226 Difference]: Without dead ends: 78 [2020-12-09 11:10:04,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=380, Invalid=1972, Unknown=0, NotChecked=0, Total=2352 [2020-12-09 11:10:04,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-12-09 11:10:04,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 47. [2020-12-09 11:10:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-12-09 11:10:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2020-12-09 11:10:04,957 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 16 [2020-12-09 11:10:04,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:10:04,957 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2020-12-09 11:10:04,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-09 11:10:04,957 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2020-12-09 11:10:04,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 11:10:04,957 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:10:04,957 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 11:10:05,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2020-12-09 11:10:05,159 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:10:05,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:10:05,159 INFO L82 PathProgramCache]: Analyzing trace with hash 170656499, now seen corresponding path program 1 times [2020-12-09 11:10:05,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:10:05,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511487400] [2020-12-09 11:10:05,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:10:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:10:05,212 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 11:10:05,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511487400] [2020-12-09 11:10:05,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:10:05,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 11:10:05,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632288917] [2020-12-09 11:10:05,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 11:10:05,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:10:05,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 11:10:05,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 11:10:05,214 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 5 states. [2020-12-09 11:10:05,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:10:05,267 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2020-12-09 11:10:05,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 11:10:05,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-12-09 11:10:05,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:10:05,268 INFO L225 Difference]: With dead ends: 46 [2020-12-09 11:10:05,268 INFO L226 Difference]: Without dead ends: 46 [2020-12-09 11:10:05,268 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 11:10:05,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-12-09 11:10:05,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-12-09 11:10:05,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-12-09 11:10:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2020-12-09 11:10:05,269 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 17 [2020-12-09 11:10:05,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:10:05,269 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2020-12-09 11:10:05,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 11:10:05,269 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2020-12-09 11:10:05,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 11:10:05,270 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:10:05,270 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:10:05,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2020-12-09 11:10:05,270 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:10:05,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:10:05,270 INFO L82 PathProgramCache]: Analyzing trace with hash 995384291, now seen corresponding path program 1 times [2020-12-09 11:10:05,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:10:05,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735827919] [2020-12-09 11:10:05,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:10:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:10:05,307 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 11:10:05,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735827919] [2020-12-09 11:10:05,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:10:05,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 11:10:05,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572369104] [2020-12-09 11:10:05,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 11:10:05,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:10:05,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 11:10:05,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 11:10:05,308 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 6 states. [2020-12-09 11:10:05,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:10:05,383 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2020-12-09 11:10:05,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 11:10:05,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-09 11:10:05,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:10:05,384 INFO L225 Difference]: With dead ends: 45 [2020-12-09 11:10:05,384 INFO L226 Difference]: Without dead ends: 45 [2020-12-09 11:10:05,384 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-12-09 11:10:05,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-12-09 11:10:05,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-12-09 11:10:05,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-12-09 11:10:05,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2020-12-09 11:10:05,385 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 18 [2020-12-09 11:10:05,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:10:05,385 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2020-12-09 11:10:05,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 11:10:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2020-12-09 11:10:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 11:10:05,386 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:10:05,386 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:10:05,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2020-12-09 11:10:05,386 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:10:05,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:10:05,386 INFO L82 PathProgramCache]: Analyzing trace with hash 995384292, now seen corresponding path program 1 times [2020-12-09 11:10:05,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:10:05,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104829245] [2020-12-09 11:10:05,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:10:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:10:05,407 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 11:10:05,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104829245] [2020-12-09 11:10:05,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:10:05,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 11:10:05,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242982274] [2020-12-09 11:10:05,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 11:10:05,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:10:05,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 11:10:05,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 11:10:05,408 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 4 states. [2020-12-09 11:10:05,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:10:05,438 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-12-09 11:10:05,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 11:10:05,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-12-09 11:10:05,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:10:05,438 INFO L225 Difference]: With dead ends: 41 [2020-12-09 11:10:05,438 INFO L226 Difference]: Without dead ends: 41 [2020-12-09 11:10:05,439 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 11:10:05,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-12-09 11:10:05,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-12-09 11:10:05,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-12-09 11:10:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2020-12-09 11:10:05,440 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 18 [2020-12-09 11:10:05,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:10:05,440 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2020-12-09 11:10:05,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 11:10:05,440 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-12-09 11:10:05,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 11:10:05,440 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:10:05,440 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 11:10:05,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2020-12-09 11:10:05,440 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:10:05,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:10:05,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1213354654, now seen corresponding path program 1 times [2020-12-09 11:10:05,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:10:05,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126826227] [2020-12-09 11:10:05,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:10:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 11:10:05,459 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 11:10:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 11:10:05,476 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 11:10:05,492 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 11:10:05,492 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 11:10:05,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2020-12-09 11:10:05,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 11:10:05 BoogieIcfgContainer [2020-12-09 11:10:05,518 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 11:10:05,518 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 11:10:05,519 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 11:10:05,519 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 11:10:05,519 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:06:59" (3/4) ... [2020-12-09 11:10:05,521 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-09 11:10:05,521 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 11:10:05,522 INFO L168 Benchmark]: Toolchain (without parser) took 187168.90 ms. Allocated memory was 96.5 MB in the beginning and 956.3 MB in the end (delta: 859.8 MB). Free memory was 58.8 MB in the beginning and 728.2 MB in the end (delta: -669.4 MB). Peak memory consumption was 190.0 MB. Max. memory is 16.1 GB. [2020-12-09 11:10:05,522 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 96.5 MB. Free memory is still 76.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 11:10:05,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.22 ms. Allocated memory is still 96.5 MB. Free memory was 58.6 MB in the beginning and 60.5 MB in the end (delta: -1.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-09 11:10:05,522 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.76 ms. Allocated memory is still 96.5 MB. Free memory was 60.5 MB in the beginning and 58.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 11:10:05,522 INFO L168 Benchmark]: Boogie Preprocessor took 29.25 ms. Allocated memory is still 96.5 MB. Free memory was 58.5 MB in the beginning and 57.2 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 11:10:05,522 INFO L168 Benchmark]: RCFGBuilder took 471.90 ms. Allocated memory is still 96.5 MB. Free memory was 57.2 MB in the beginning and 54.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 16.1 GB. [2020-12-09 11:10:05,523 INFO L168 Benchmark]: TraceAbstraction took 186337.78 ms. Allocated memory was 96.5 MB in the beginning and 956.3 MB in the end (delta: 859.8 MB). Free memory was 54.2 MB in the beginning and 728.2 MB in the end (delta: -674.0 MB). Peak memory consumption was 187.4 MB. Max. memory is 16.1 GB. [2020-12-09 11:10:05,523 INFO L168 Benchmark]: Witness Printer took 2.56 ms. Allocated memory is still 956.3 MB. Free memory is still 728.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 11:10:05,524 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.17 ms. Allocated memory is still 96.5 MB. Free memory is still 76.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 290.22 ms. Allocated memory is still 96.5 MB. Free memory was 58.6 MB in the beginning and 60.5 MB in the end (delta: -1.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 31.76 ms. Allocated memory is still 96.5 MB. Free memory was 60.5 MB in the beginning and 58.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 29.25 ms. Allocated memory is still 96.5 MB. Free memory was 58.5 MB in the beginning and 57.2 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 471.90 ms. Allocated memory is still 96.5 MB. Free memory was 57.2 MB in the beginning and 54.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 186337.78 ms. Allocated memory was 96.5 MB in the beginning and 956.3 MB in the end (delta: 859.8 MB). Free memory was 54.2 MB in the beginning and 728.2 MB in the end (delta: -674.0 MB). Peak memory consumption was 187.4 MB. Max. memory is 16.1 GB. * Witness Printer took 2.56 ms. Allocated memory is still 956.3 MB. Free memory is still 728.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 539]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 539. Possible FailurePath: [L524] int c = 0; [L541] struct item *list = ((void *)0); [L542] int length = 0; VAL [c=0] [L531] c++ [L532] struct item *item = malloc(sizeof *item); VAL [c=1] [L533] EXPR \read(**plist) VAL [c=1] [L533] item->next = *plist [L534] EXPR item->next VAL [c=1] [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [c=1] [L534-L536] item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L537] *plist = item [L545] length++ [L546] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L547] COND TRUE length > 0 VAL [c=1] [L548] COND FALSE !(length < 0) VAL [c=1] [L551] EXPR \read(*list) VAL [c=1] [L551] EXPR list->next [L551] struct item *next = list->next; [L552] EXPR \read(*list) VAL [c=1] [L552] free(list) VAL [c=1] [L552] free(list) VAL [c=1] [L552] free(list) [L553] list = next [L554] length-- VAL [c=1] [L556] COND FALSE !(length > 0) [L562] return 0; [L541] struct item *list = ((void *)0); [L562] return 0; VAL [c=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 79 locations, 44 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 186.2s, OverallIterations: 17, TraceHistogramMax: 2, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 521 SDtfs, 1344 SDslu, 782 SDs, 0 SdLazy, 1690 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 45 SyntacticMatches, 11 SemanticMatches, 140 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 204 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 228 ConstructedInterpolants, 29 QuantifiedInterpolants, 40843 SizeOfPredicates, 50 NumberOfNonLiveVariables, 352 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 4/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-7b2dab5 [2020-12-09 11:10:07,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 11:10:07,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 11:10:07,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 11:10:07,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 11:10:07,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 11:10:07,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 11:10:07,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 11:10:07,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 11:10:07,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 11:10:07,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 11:10:07,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 11:10:07,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 11:10:07,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 11:10:07,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 11:10:07,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 11:10:07,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 11:10:07,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 11:10:07,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 11:10:07,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 11:10:07,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 11:10:07,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 11:10:07,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 11:10:07,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 11:10:07,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 11:10:07,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 11:10:07,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 11:10:07,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 11:10:07,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 11:10:07,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 11:10:07,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 11:10:07,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 11:10:07,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 11:10:07,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 11:10:07,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 11:10:07,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 11:10:07,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 11:10:07,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 11:10:07,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 11:10:07,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 11:10:07,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 11:10:07,214 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2020-12-09 11:10:07,239 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 11:10:07,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 11:10:07,240 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 11:10:07,240 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 11:10:07,241 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 11:10:07,241 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 11:10:07,241 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 11:10:07,241 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 11:10:07,241 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 11:10:07,242 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 11:10:07,242 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 11:10:07,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 11:10:07,242 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 11:10:07,242 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 11:10:07,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 11:10:07,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 11:10:07,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 11:10:07,243 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 11:10:07,243 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 11:10:07,243 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 11:10:07,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 11:10:07,244 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 11:10:07,244 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 11:10:07,244 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 11:10:07,244 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 11:10:07,244 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 11:10:07,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 11:10:07,245 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 11:10:07,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 11:10:07,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 11:10:07,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 11:10:07,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 11:10:07,245 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 11:10:07,245 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 11:10:07,246 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 11:10:07,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 11:10:07,246 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_1f051525-3842-4a59-871e-64218cf7a913/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_1f051525-3842-4a59-871e-64218cf7a913/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 -> 86beb7e463e80bf4cd7303ba718fa4bc3c1db625 [2020-12-09 11:10:07,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 11:10:07,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 11:10:07,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 11:10:07,480 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 11:10:07,481 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 11:10:07,482 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2020-12-09 11:10:07,522 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/data/6e4a16152/d9312273cff44b808e8af5d0575a8f75/FLAG1e709c161 [2020-12-09 11:10:08,008 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 11:10:08,008 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2020-12-09 11:10:08,019 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/data/6e4a16152/d9312273cff44b808e8af5d0575a8f75/FLAG1e709c161 [2020-12-09 11:10:08,029 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/data/6e4a16152/d9312273cff44b808e8af5d0575a8f75 [2020-12-09 11:10:08,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 11:10:08,032 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 11:10:08,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 11:10:08,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 11:10:08,035 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 11:10:08,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:10:08" (1/1) ... [2020-12-09 11:10:08,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cfa32a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:08, skipping insertion in model container [2020-12-09 11:10:08,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:10:08" (1/1) ... [2020-12-09 11:10:08,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 11:10:08,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 11:10:08,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 11:10:08,275 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 11:10:08,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 11:10:08,349 INFO L208 MainTranslator]: Completed translation [2020-12-09 11:10:08,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:08 WrapperNode [2020-12-09 11:10:08,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 11:10:08,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 11:10:08,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 11:10:08,350 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 11:10:08,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:08" (1/1) ... [2020-12-09 11:10:08,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:08" (1/1) ... [2020-12-09 11:10:08,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 11:10:08,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 11:10:08,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 11:10:08,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 11:10:08,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:08" (1/1) ... [2020-12-09 11:10:08,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:08" (1/1) ... [2020-12-09 11:10:08,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:08" (1/1) ... [2020-12-09 11:10:08,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:08" (1/1) ... [2020-12-09 11:10:08,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:08" (1/1) ... [2020-12-09 11:10:08,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:08" (1/1) ... [2020-12-09 11:10:08,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:08" (1/1) ... [2020-12-09 11:10:08,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 11:10:08,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 11:10:08,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 11:10:08,414 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 11:10:08,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/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 11:10:08,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 11:10:08,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-09 11:10:08,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 11:10:08,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 11:10:08,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 11:10:08,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-09 11:10:08,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-09 11:10:08,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 11:10:08,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 11:10:08,945 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 11:10:08,945 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2020-12-09 11:10:08,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:10:08 BoogieIcfgContainer [2020-12-09 11:10:08,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 11:10:08,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 11:10:08,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 11:10:08,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 11:10:08,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 11:10:08" (1/3) ... [2020-12-09 11:10:08,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b27784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:10:08, skipping insertion in model container [2020-12-09 11:10:08,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:08" (2/3) ... [2020-12-09 11:10:08,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b27784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:10:08, skipping insertion in model container [2020-12-09 11:10:08,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:10:08" (3/3) ... [2020-12-09 11:10:08,952 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2020-12-09 11:10:08,961 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 11:10:08,964 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2020-12-09 11:10:08,971 INFO L253 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2020-12-09 11:10:08,985 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 11:10:08,985 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 11:10:08,985 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 11:10:08,985 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 11:10:08,985 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 11:10:08,985 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 11:10:08,985 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 11:10:08,986 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 11:10:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-12-09 11:10:09,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 11:10:09,001 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:10:09,002 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 11:10:09,002 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:10:09,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:10:09,006 INFO L82 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2020-12-09 11:10:09,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 11:10:09,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463544670] [2020-12-09 11:10:09,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/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 11:10:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:10:09,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 11:10:09,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:10:09,136 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 11:10:09,137 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:09,143 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:09,144 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:10:09,144 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 11:10:09,197 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:09,197 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-09 11:10:09,205 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:09,211 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:09,219 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:10:09,219 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:17 [2020-12-09 11:10:09,237 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 11:10:09,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 11:10:09,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463544670] [2020-12-09 11:10:09,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:10:09,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 11:10:09,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512207404] [2020-12-09 11:10:09,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 11:10:09,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 11:10:09,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 11:10:09,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 11:10:09,258 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2020-12-09 11:10:09,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:10:09,565 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2020-12-09 11:10:09,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 11:10:09,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-12-09 11:10:09,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:10:09,573 INFO L225 Difference]: With dead ends: 115 [2020-12-09 11:10:09,573 INFO L226 Difference]: Without dead ends: 113 [2020-12-09 11:10:09,574 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 11:10:09,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-12-09 11:10:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 83. [2020-12-09 11:10:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-12-09 11:10:09,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2020-12-09 11:10:09,600 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 4 [2020-12-09 11:10:09,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:10:09,600 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2020-12-09 11:10:09,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 11:10:09,600 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2020-12-09 11:10:09,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 11:10:09,600 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:10:09,600 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 11:10:09,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 11:10:09,802 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:10:09,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:10:09,803 INFO L82 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2020-12-09 11:10:09,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 11:10:09,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651623344] [2020-12-09 11:10:09,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/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 11:10:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:10:09,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 11:10:09,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:10:09,969 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 11:10:09,970 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:09,976 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:09,979 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 11:10:09,980 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:09,986 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:09,986 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:10:09,987 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-12-09 11:10:10,018 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:10,018 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-09 11:10:10,019 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:10,028 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:10,031 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 11:10:10,033 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:10,047 INFO L625 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2020-12-09 11:10:10,049 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:10:10,049 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:16 [2020-12-09 11:10:10,062 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 11:10:10,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 11:10:10,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651623344] [2020-12-09 11:10:10,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:10:10,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 11:10:10,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352084176] [2020-12-09 11:10:10,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 11:10:10,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 11:10:10,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 11:10:10,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 11:10:10,064 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 4 states. [2020-12-09 11:10:10,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:10:10,546 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2020-12-09 11:10:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 11:10:10,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-12-09 11:10:10,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:10:10,548 INFO L225 Difference]: With dead ends: 193 [2020-12-09 11:10:10,548 INFO L226 Difference]: Without dead ends: 193 [2020-12-09 11:10:10,549 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 11:10:10,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-12-09 11:10:10,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 92. [2020-12-09 11:10:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-12-09 11:10:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2020-12-09 11:10:10,556 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 4 [2020-12-09 11:10:10,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:10:10,557 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2020-12-09 11:10:10,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 11:10:10,557 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2020-12-09 11:10:10,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 11:10:10,557 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:10:10,557 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 11:10:10,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 11:10:10,759 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:10:10,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:10:10,761 INFO L82 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2020-12-09 11:10:10,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 11:10:10,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623287223] [2020-12-09 11:10:10,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/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 11:10:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:10:10,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 11:10:10,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:10:10,885 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 11:10:10,886 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:10,888 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:10,888 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:10:10,888 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 11:10:10,892 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 11:10:10,892 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 11:10:10,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623287223] [2020-12-09 11:10:10,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:10:10,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 11:10:10,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106137370] [2020-12-09 11:10:10,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 11:10:10,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 11:10:10,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 11:10:10,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 11:10:10,894 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 3 states. [2020-12-09 11:10:11,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:10:11,022 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2020-12-09 11:10:11,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 11:10:11,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 11:10:11,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:10:11,023 INFO L225 Difference]: With dead ends: 106 [2020-12-09 11:10:11,023 INFO L226 Difference]: Without dead ends: 106 [2020-12-09 11:10:11,024 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 11:10:11,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-12-09 11:10:11,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2020-12-09 11:10:11,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-12-09 11:10:11,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2020-12-09 11:10:11,029 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 5 [2020-12-09 11:10:11,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:10:11,029 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2020-12-09 11:10:11,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 11:10:11,029 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2020-12-09 11:10:11,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 11:10:11,030 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:10:11,030 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 11:10:11,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 11:10:11,232 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:10:11,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:10:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2020-12-09 11:10:11,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 11:10:11,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2683336] [2020-12-09 11:10:11,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/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 11:10:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:10:11,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 11:10:11,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:10:11,379 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 11:10:11,380 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:11,385 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:11,385 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:10:11,386 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:11 [2020-12-09 11:10:11,393 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 11:10:11,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 11:10:11,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2683336] [2020-12-09 11:10:11,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:10:11,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 11:10:11,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801181620] [2020-12-09 11:10:11,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 11:10:11,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 11:10:11,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 11:10:11,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 11:10:11,395 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand 3 states. [2020-12-09 11:10:11,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:10:11,515 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2020-12-09 11:10:11,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 11:10:11,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 11:10:11,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:10:11,516 INFO L225 Difference]: With dead ends: 85 [2020-12-09 11:10:11,517 INFO L226 Difference]: Without dead ends: 85 [2020-12-09 11:10:11,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 11:10:11,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-12-09 11:10:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2020-12-09 11:10:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-12-09 11:10:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2020-12-09 11:10:11,523 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 5 [2020-12-09 11:10:11,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:10:11,523 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2020-12-09 11:10:11,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 11:10:11,523 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2020-12-09 11:10:11,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 11:10:11,523 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:10:11,523 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:10:11,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 11:10:11,726 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:10:11,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:10:11,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2020-12-09 11:10:11,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 11:10:11,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468952608] [2020-12-09 11:10:11,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/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 11:10:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:10:11,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 11:10:11,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:10:11,885 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 11:10:11,885 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2020-12-09 11:10:11,887 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:11,901 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:11,922 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 11:10:11,923 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2020-12-09 11:10:11,924 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:11,938 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:11,939 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 11:10:11,940 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2020-12-09 11:10:12,000 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:12,001 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2020-12-09 11:10:12,003 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:12,013 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:12,021 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:12,021 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2020-12-09 11:10:12,023 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:12,027 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:12,027 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:10:12,028 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:47, output treesize:7 [2020-12-09 11:10:12,042 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 11:10:12,042 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 11:10:12,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468952608] [2020-12-09 11:10:12,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:10:12,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 11:10:12,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337500478] [2020-12-09 11:10:12,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 11:10:12,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 11:10:12,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 11:10:12,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 11:10:12,044 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 7 states. [2020-12-09 11:10:12,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:10:12,609 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2020-12-09 11:10:12,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 11:10:12,609 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2020-12-09 11:10:12,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:10:12,610 INFO L225 Difference]: With dead ends: 94 [2020-12-09 11:10:12,610 INFO L226 Difference]: Without dead ends: 94 [2020-12-09 11:10:12,611 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-12-09 11:10:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-12-09 11:10:12,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2020-12-09 11:10:12,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-12-09 11:10:12,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2020-12-09 11:10:12,617 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 10 [2020-12-09 11:10:12,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:10:12,617 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2020-12-09 11:10:12,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 11:10:12,617 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2020-12-09 11:10:12,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 11:10:12,618 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:10:12,618 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:10:12,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 11:10:12,819 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:10:12,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:10:12,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1762075788, now seen corresponding path program 1 times [2020-12-09 11:10:12,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 11:10:12,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029202492] [2020-12-09 11:10:12,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/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 11:10:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:10:12,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 11:10:12,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:10:12,925 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 11:10:12,926 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:12,930 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:12,931 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:10:12,931 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:10, output treesize:9 [2020-12-09 11:10:12,978 INFO L443 ElimStorePlain]: Different costs {1=[|v_#valid_63|], 3=[|v_#length_48|]} [2020-12-09 11:10:12,987 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:12,987 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 11:10:12,988 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:13,005 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:13,025 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:13,025 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 46 [2020-12-09 11:10:13,028 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:13,067 INFO L625 ElimStorePlain]: treesize reduction 26, result has 49.0 percent of original size [2020-12-09 11:10:13,069 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 11:10:13,069 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:25 [2020-12-09 11:10:13,114 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 11:10:13,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 11:10:13,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029202492] [2020-12-09 11:10:13,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:10:13,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 11:10:13,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549185394] [2020-12-09 11:10:13,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 11:10:13,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 11:10:13,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 11:10:13,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 11:10:13,116 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 6 states. [2020-12-09 11:10:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:10:13,586 INFO L93 Difference]: Finished difference Result 188 states and 197 transitions. [2020-12-09 11:10:13,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 11:10:13,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-12-09 11:10:13,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:10:13,588 INFO L225 Difference]: With dead ends: 188 [2020-12-09 11:10:13,588 INFO L226 Difference]: Without dead ends: 188 [2020-12-09 11:10:13,588 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-12-09 11:10:13,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-12-09 11:10:13,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 86. [2020-12-09 11:10:13,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-12-09 11:10:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2020-12-09 11:10:13,592 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 11 [2020-12-09 11:10:13,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:10:13,593 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2020-12-09 11:10:13,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 11:10:13,593 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2020-12-09 11:10:13,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 11:10:13,593 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:10:13,593 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 11:10:13,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 11:10:13,795 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:10:13,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:10:13,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1870124675, now seen corresponding path program 1 times [2020-12-09 11:10:13,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 11:10:13,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988530490] [2020-12-09 11:10:13,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/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 11:10:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:10:13,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 11:10:13,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:10:13,970 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 11:10:13,970 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:13,978 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:13,979 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:10:13,979 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2020-12-09 11:10:13,992 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-12-09 11:10:13,993 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:13,996 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:13,997 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:10:13,997 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2020-12-09 11:10:14,003 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 11:10:14,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 11:10:14,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988530490] [2020-12-09 11:10:14,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:10:14,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 11:10:14,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017174231] [2020-12-09 11:10:14,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 11:10:14,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 11:10:14,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 11:10:14,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 11:10:14,005 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 6 states. [2020-12-09 11:10:14,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:10:14,348 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2020-12-09 11:10:14,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 11:10:14,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-09 11:10:14,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:10:14,350 INFO L225 Difference]: With dead ends: 102 [2020-12-09 11:10:14,350 INFO L226 Difference]: Without dead ends: 102 [2020-12-09 11:10:14,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 11:10:14,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-12-09 11:10:14,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 86. [2020-12-09 11:10:14,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-12-09 11:10:14,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2020-12-09 11:10:14,353 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 17 [2020-12-09 11:10:14,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:10:14,353 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2020-12-09 11:10:14,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 11:10:14,353 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2020-12-09 11:10:14,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 11:10:14,354 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:10:14,354 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 11:10:14,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-09 11:10:14,555 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:10:14,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:10:14,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1870124676, now seen corresponding path program 1 times [2020-12-09 11:10:14,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 11:10:14,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035783325] [2020-12-09 11:10:14,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-12-09 11:10:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:10:14,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 11:10:14,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:10:14,682 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 11:10:14,682 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:14,692 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:14,695 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 11:10:14,696 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:14,703 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:14,704 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:10:14,704 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2020-12-09 11:10:14,724 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 11:10:14,725 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:14,733 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:14,734 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-12-09 11:10:14,735 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:14,740 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:14,740 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:10:14,740 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2020-12-09 11:10:14,752 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 11:10:14,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 11:10:14,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035783325] [2020-12-09 11:10:14,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:10:14,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 11:10:14,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877337164] [2020-12-09 11:10:14,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 11:10:14,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 11:10:14,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 11:10:14,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 11:10:14,753 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 6 states. [2020-12-09 11:10:15,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:10:15,083 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2020-12-09 11:10:15,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 11:10:15,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-09 11:10:15,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:10:15,084 INFO L225 Difference]: With dead ends: 97 [2020-12-09 11:10:15,084 INFO L226 Difference]: Without dead ends: 97 [2020-12-09 11:10:15,084 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 11:10:15,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-12-09 11:10:15,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2020-12-09 11:10:15,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-12-09 11:10:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2020-12-09 11:10:15,087 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 17 [2020-12-09 11:10:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:10:15,087 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2020-12-09 11:10:15,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 11:10:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2020-12-09 11:10:15,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 11:10:15,088 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:10:15,088 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 11:10:15,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-12-09 11:10:15,289 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:10:15,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:10:15,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1870110741, now seen corresponding path program 1 times [2020-12-09 11:10:15,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 11:10:15,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11308166] [2020-12-09 11:10:15,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-12-09 11:10:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:10:15,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 11:10:15,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:10:15,413 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 11:10:15,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 11:10:15,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11308166] [2020-12-09 11:10:15,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:10:15,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 11:10:15,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371715752] [2020-12-09 11:10:15,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 11:10:15,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 11:10:15,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 11:10:15,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 11:10:15,414 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 4 states. [2020-12-09 11:10:15,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:10:15,439 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2020-12-09 11:10:15,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 11:10:15,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-12-09 11:10:15,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:10:15,441 INFO L225 Difference]: With dead ends: 125 [2020-12-09 11:10:15,441 INFO L226 Difference]: Without dead ends: 125 [2020-12-09 11:10:15,441 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 11:10:15,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-12-09 11:10:15,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 102. [2020-12-09 11:10:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-12-09 11:10:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2020-12-09 11:10:15,444 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 17 [2020-12-09 11:10:15,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:10:15,444 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2020-12-09 11:10:15,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 11:10:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2020-12-09 11:10:15,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 11:10:15,445 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:10:15,445 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 11:10:15,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-12-09 11:10:15,646 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:10:15,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:10:15,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1431526068, now seen corresponding path program 1 times [2020-12-09 11:10:15,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 11:10:15,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725479931] [2020-12-09 11:10:15,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/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 11:10:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:10:15,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 11:10:15,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:10:15,836 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 11:10:15,837 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:15,839 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:15,839 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:10:15,839 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-12-09 11:10:15,854 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 11:10:15,855 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:15,857 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:15,857 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:10:15,857 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-12-09 11:10:15,862 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 11:10:15,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 11:10:15,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725479931] [2020-12-09 11:10:15,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:10:15,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 11:10:15,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790733569] [2020-12-09 11:10:15,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 11:10:15,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 11:10:15,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 11:10:15,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 11:10:15,863 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand 5 states. [2020-12-09 11:10:16,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:10:16,053 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2020-12-09 11:10:16,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 11:10:16,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-12-09 11:10:16,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:10:16,055 INFO L225 Difference]: With dead ends: 113 [2020-12-09 11:10:16,055 INFO L226 Difference]: Without dead ends: 113 [2020-12-09 11:10:16,055 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 11:10:16,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-12-09 11:10:16,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2020-12-09 11:10:16,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-12-09 11:10:16,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2020-12-09 11:10:16,057 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 20 [2020-12-09 11:10:16,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:10:16,057 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2020-12-09 11:10:16,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 11:10:16,057 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2020-12-09 11:10:16,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 11:10:16,058 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:10:16,058 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 11:10:16,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-12-09 11:10:16,260 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:10:16,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:10:16,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1427635036, now seen corresponding path program 1 times [2020-12-09 11:10:16,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 11:10:16,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097635085] [2020-12-09 11:10:16,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-12-09 11:10:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:10:16,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 11:10:16,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:10:16,510 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 11:10:16,510 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:16,518 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:16,518 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:10:16,518 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2020-12-09 11:10:16,537 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-12-09 11:10:16,538 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:16,543 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:16,543 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:10:16,543 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2020-12-09 11:10:16,557 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 11:10:16,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 11:10:16,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097635085] [2020-12-09 11:10:16,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:10:16,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 11:10:16,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496781820] [2020-12-09 11:10:16,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 11:10:16,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 11:10:16,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 11:10:16,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 11:10:16,558 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 6 states. [2020-12-09 11:10:16,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:10:16,881 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2020-12-09 11:10:16,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 11:10:16,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-09 11:10:16,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:10:16,883 INFO L225 Difference]: With dead ends: 112 [2020-12-09 11:10:16,883 INFO L226 Difference]: Without dead ends: 112 [2020-12-09 11:10:16,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-09 11:10:16,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-12-09 11:10:16,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2020-12-09 11:10:16,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-12-09 11:10:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2020-12-09 11:10:16,885 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 21 [2020-12-09 11:10:16,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:10:16,885 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2020-12-09 11:10:16,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 11:10:16,885 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2020-12-09 11:10:16,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 11:10:16,886 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:10:16,886 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:10:17,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-12-09 11:10:17,087 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:10:17,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:10:17,088 INFO L82 PathProgramCache]: Analyzing trace with hash 717052317, now seen corresponding path program 1 times [2020-12-09 11:10:17,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 11:10:17,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343452569] [2020-12-09 11:10:17,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-12-09 11:10:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:10:17,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-09 11:10:17,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:10:17,241 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 11:10:17,242 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:17,250 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:17,251 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:10:17,251 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2020-12-09 11:10:17,295 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 11:10:17,295 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:17,303 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:17,304 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:10:17,304 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2020-12-09 11:10:17,336 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:17,336 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2020-12-09 11:10:17,338 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:17,360 INFO L625 ElimStorePlain]: treesize reduction 26, result has 36.6 percent of original size [2020-12-09 11:10:17,361 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:10:17,361 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2020-12-09 11:10:17,435 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 11:10:17,436 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2020-12-09 11:10:17,437 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:17,447 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:17,448 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 11:10:17,448 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-12-09 11:10:17,493 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-12-09 11:10:17,493 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:17,498 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:17,499 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:10:17,499 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:11 [2020-12-09 11:10:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:10:17,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 11:10:17,589 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 36 treesize of output 32 [2020-12-09 11:10:17,591 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 11:10:17,608 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:17,609 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:10:17,609 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:28 [2020-12-09 11:10:17,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:10:17,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343452569] [2020-12-09 11:10:17,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1173911436] [2020-12-09 11:10:17,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt [2020-12-09 11:10:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:10:17,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-09 11:10:17,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:10:17,980 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2020-12-09 11:10:17,981 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:17,986 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:17,986 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:10:17,987 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2020-12-09 11:10:18,024 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 11:10:18,024 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:18,030 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:18,031 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:10:18,031 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2020-12-09 11:10:18,074 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:18,074 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 46 [2020-12-09 11:10:18,076 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:18,093 INFO L625 ElimStorePlain]: treesize reduction 26, result has 43.5 percent of original size [2020-12-09 11:10:18,093 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:10:18,093 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2020-12-09 11:10:18,188 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 11:10:18,188 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2020-12-09 11:10:18,189 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:18,198 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:18,199 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:10:18,199 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:26 [2020-12-09 11:10:18,275 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:18,275 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2020-12-09 11:10:18,277 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:18,283 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:18,284 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:10:18,284 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:11 [2020-12-09 11:10:18,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:10:18,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 11:10:18,313 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2020-12-09 11:10:18,314 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 11:10:18,336 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:18,337 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:10:18,337 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:30 [2020-12-09 11:10:18,418 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:18,418 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2020-12-09 11:10:18,420 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:10:18,423 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:18,434 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:18,434 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2020-12-09 11:10:18,435 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:10:18,437 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:18,451 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:18,452 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-09 11:10:18,452 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:7 [2020-12-09 11:10:18,462 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-12-09 11:10:18,462 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:18,465 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-12-09 11:10:18,466 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:18,470 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:18,470 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-09 11:10:18,471 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2020-12-09 11:10:18,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:10:18,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43453179] [2020-12-09 11:10:18,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 11:10:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:10:18,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 11:10:18,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:10:18,540 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 11:10:18,541 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:18,545 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:18,546 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:10:18,546 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2020-12-09 11:10:18,567 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:18,567 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 59 [2020-12-09 11:10:18,569 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:18,575 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:18,576 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:10:18,576 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:25 [2020-12-09 11:10:18,693 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 11:10:18,694 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2020-12-09 11:10:18,694 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:18,705 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:18,707 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-09 11:10:18,707 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:36 [2020-12-09 11:10:18,815 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:18,815 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2020-12-09 11:10:18,816 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:18,822 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:18,823 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:10:18,823 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:43, output treesize:19 [2020-12-09 11:10:18,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:10:18,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 11:10:22,750 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 38 treesize of output 34 [2020-12-09 11:10:22,751 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 11:10:22,773 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:22,774 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:10:22,774 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 11:10:22,775 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:10:22,776 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 11:10:22,776 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:42 [2020-12-09 11:10:22,777 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:10:22,778 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:10:22,778 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 11:10:43,889 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:10:43,889 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 11:10:43,890 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:10:56,237 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 11:10:56,237 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:10:56,238 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:10:56,239 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 11:10:56,240 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 11:10:56,240 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 11:10:56,241 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 11:10:56,241 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:10:56,245 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 11:10:56,246 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:10:56,247 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-12-09 11:10:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:10:56,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 11:10:56,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 8, 8, 8] total 27 [2020-12-09 11:10:56,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381356592] [2020-12-09 11:10:56,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-12-09 11:10:56,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 11:10:56,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-12-09 11:10:56,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=655, Unknown=10, NotChecked=0, Total=756 [2020-12-09 11:10:56,260 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 28 states. [2020-12-09 11:10:57,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:10:57,937 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2020-12-09 11:10:57,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 11:10:57,937 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 21 [2020-12-09 11:10:57,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:10:57,938 INFO L225 Difference]: With dead ends: 122 [2020-12-09 11:10:57,938 INFO L226 Difference]: Without dead ends: 122 [2020-12-09 11:10:57,938 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 88 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 38.8s TimeCoverageRelationStatistics Valid=311, Invalid=1085, Unknown=10, NotChecked=0, Total=1406 [2020-12-09 11:10:57,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-12-09 11:10:57,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 99. [2020-12-09 11:10:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-12-09 11:10:57,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2020-12-09 11:10:57,941 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 21 [2020-12-09 11:10:57,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:10:57,941 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2020-12-09 11:10:57,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-12-09 11:10:57,941 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2020-12-09 11:10:57,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 11:10:57,941 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:10:57,941 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:10:58,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt,13 mathsat -unsat_core_generation=3,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 11:10:58,544 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:10:58,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:10:58,545 INFO L82 PathProgramCache]: Analyzing trace with hash 717052318, now seen corresponding path program 1 times [2020-12-09 11:10:58,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 11:10:58,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846295311] [2020-12-09 11:10:58,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-12-09 11:10:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:10:58,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 28 conjunts are in the unsatisfiable core [2020-12-09 11:10:58,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:10:58,666 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 11:10:58,667 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:58,680 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:58,683 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 11:10:58,684 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:58,695 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:58,696 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:10:58,696 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:22 [2020-12-09 11:10:58,730 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:58,730 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 11:10:58,731 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:58,749 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:58,753 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 11:10:58,754 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:58,770 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:58,771 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:10:58,771 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:28 [2020-12-09 11:10:58,841 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 11:10:58,842 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:58,861 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:58,865 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 11:10:58,866 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:58,882 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:58,883 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:10:58,883 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:43 [2020-12-09 11:10:58,923 INFO L443 ElimStorePlain]: Different costs {1=[|v_#valid_79|], 3=[|v_#length_60|]} [2020-12-09 11:10:58,935 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:58,935 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2020-12-09 11:10:58,936 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:58,955 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:58,974 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:58,975 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 42 [2020-12-09 11:10:58,976 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:59,019 INFO L625 ElimStorePlain]: treesize reduction 16, result has 73.8 percent of original size [2020-12-09 11:10:59,021 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 11:10:59,021 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:45 [2020-12-09 11:10:59,137 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 11:10:59,137 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2020-12-09 11:10:59,138 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:59,161 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:59,186 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 11:10:59,186 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2020-12-09 11:10:59,187 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:59,204 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:59,206 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-09 11:10:59,206 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:64, output treesize:52 [2020-12-09 11:10:59,287 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 11:10:59,287 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:59,301 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:59,303 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-12-09 11:10:59,304 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:10:59,313 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:10:59,314 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:10:59,314 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:20 [2020-12-09 11:10:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:10:59,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 11:10:59,655 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:11:09,468 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2020-12-09 11:11:09,470 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 11:11:09,595 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-12-09 11:11:09,595 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:09,610 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2020-12-09 11:11:09,612 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 11:11:09,841 WARN L197 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2020-12-09 11:11:09,841 INFO L625 ElimStorePlain]: treesize reduction 18, result has 82.2 percent of original size [2020-12-09 11:11:09,858 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2020-12-09 11:11:09,862 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2020-12-09 11:11:09,974 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-12-09 11:11:09,974 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:09,976 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:11:09,976 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:11:09,977 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:11:09,978 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-12-09 11:11:09,978 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:80, output treesize:66 [2020-12-09 11:11:09,979 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:11:09,980 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:11:09,980 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:11:15,949 WARN L197 SmtUtils]: Spent 5.50 s on a formula simplification that was a NOOP. DAG size: 44 [2020-12-09 11:11:15,952 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:11:15,952 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:11:15,954 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:11:16,371 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:11:16,372 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:11:16,372 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:11:16,373 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:11:16,374 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-12-09 11:11:16,374 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:11:16,375 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:11:16,377 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:11:16,378 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 11:11:16,380 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:11:16,381 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:11:16,381 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:11:16,382 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:11:16,383 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:11:16,384 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:11:16,413 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:16,413 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 11:11:16,414 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:16,445 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:16,445 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 11:11:16,446 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:16,482 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:16,482 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 11:11:16,483 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:16,511 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:16,511 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 11:11:16,512 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:16,538 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:16,538 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 11:11:16,539 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:16,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 11:11:16,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 11:11:16,560 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 11:11:16,561 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:16,583 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:16,583 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 11:11:16,584 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:16,723 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-12-09 11:11:16,723 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:16,726 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 6 xjuncts. [2020-12-09 11:11:16,726 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:169, output treesize:70 [2020-12-09 11:11:18,931 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 11:11:27,633 WARN L197 SmtUtils]: Spent 4.46 s on a formula simplification that was a NOOP. DAG size: 33 [2020-12-09 11:11:41,263 WARN L197 SmtUtils]: Spent 5.27 s on a formula simplification that was a NOOP. DAG size: 47 [2020-12-09 11:11:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:11:41,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846295311] [2020-12-09 11:11:41,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [364879401] [2020-12-09 11:11:41,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt [2020-12-09 11:11:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:11:41,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 28 conjunts are in the unsatisfiable core [2020-12-09 11:11:41,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:11:41,542 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 11:11:41,542 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:41,563 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:41,568 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 11:11:41,569 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:41,590 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:41,590 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:11:41,590 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:25 [2020-12-09 11:11:41,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 11:11:41,691 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 11:11:41,692 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:41,722 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:41,737 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:41,737 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-09 11:11:41,738 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:41,764 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:41,765 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:11:41,765 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:29 [2020-12-09 11:11:41,985 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 11:11:41,986 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:42,016 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:42,021 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 11:11:42,022 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:42,047 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:42,048 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:11:42,048 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:44 [2020-12-09 11:11:42,181 INFO L443 ElimStorePlain]: Different costs {1=[|v_#valid_85|], 3=[|v_#length_66|]} [2020-12-09 11:11:42,197 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:42,197 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2020-12-09 11:11:42,198 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:42,230 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:42,260 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:42,261 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 44 [2020-12-09 11:11:42,262 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:42,324 INFO L625 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2020-12-09 11:11:42,325 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 11:11:42,325 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:46 [2020-12-09 11:11:42,624 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 11:11:42,624 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2020-12-09 11:11:42,625 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:42,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:42,689 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 11:11:42,689 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2020-12-09 11:11:42,690 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:42,715 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:42,716 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 11:11:42,717 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:48 [2020-12-09 11:11:42,903 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:42,903 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2020-12-09 11:11:42,904 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:42,930 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:42,946 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:42,946 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2020-12-09 11:11:42,947 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:42,962 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:42,962 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:11:42,963 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:62, output treesize:18 [2020-12-09 11:11:43,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:11:43,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 11:11:43,018 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:11:45,681 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2020-12-09 11:11:45,683 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 11:11:45,830 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-12-09 11:11:45,830 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:45,846 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2020-12-09 11:11:45,848 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 11:11:46,105 WARN L197 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2020-12-09 11:11:46,106 INFO L625 ElimStorePlain]: treesize reduction 18, result has 82.2 percent of original size [2020-12-09 11:11:46,122 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2020-12-09 11:11:46,126 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2020-12-09 11:11:46,259 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-12-09 11:11:46,259 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:46,261 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:11:46,261 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:11:46,262 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:11:46,263 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-12-09 11:11:46,263 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:80, output treesize:66 [2020-12-09 11:11:46,264 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:11:46,264 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:11:46,265 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:11:47,539 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:11:47,540 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:11:47,541 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:11:48,148 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:11:48,149 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:11:48,149 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:11:48,150 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:11:48,151 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-12-09 11:11:48,152 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:11:48,152 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:11:48,154 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:11:48,155 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 11:11:48,157 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:11:48,157 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:11:48,158 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:11:48,159 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:11:48,159 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:11:48,160 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:11:48,194 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:48,194 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 11:11:48,195 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:48,224 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:48,224 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 11:11:48,225 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:48,267 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:48,267 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 11:11:48,268 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:48,297 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:48,297 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 11:11:48,298 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:48,332 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:48,333 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 11:11:48,333 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:48,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 11:11:48,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 11:11:48,359 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 11:11:48,360 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:48,380 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:48,381 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 11:11:48,381 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-12-09 11:11:48,532 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-12-09 11:11:48,533 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:11:48,535 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 6 xjuncts. [2020-12-09 11:11:48,536 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:169, output treesize:70 [2020-12-09 11:11:48,539 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 11:12:06,882 WARN L197 SmtUtils]: Spent 6.24 s on a formula simplification that was a NOOP. DAG size: 33 [2020-12-09 11:12:28,446 WARN L197 SmtUtils]: Spent 4.66 s on a formula simplification that was a NOOP. DAG size: 47 [2020-12-09 11:12:28,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:12:28,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588613690] [2020-12-09 11:12:28,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 11:12:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:12:28,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-09 11:12:28,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:12:28,764 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 11:12:28,765 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:28,785 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:28,792 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 11:12:28,793 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:28,809 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:28,810 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:12:28,810 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2020-12-09 11:12:28,940 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:28,940 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2020-12-09 11:12:28,941 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:28,959 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:28,963 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2020-12-09 11:12:28,964 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:28,979 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:28,980 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:12:28,980 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2020-12-09 11:12:29,288 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 11:12:29,288 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2020-12-09 11:12:29,289 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:29,321 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:29,357 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-09 11:12:29,357 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2020-12-09 11:12:29,358 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:29,387 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:29,388 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-09 11:12:29,388 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:52 [2020-12-09 11:12:29,569 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 11:12:29,570 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:29,590 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:29,594 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 25 treesize of output 13 [2020-12-09 11:12:29,594 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:29,610 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:29,610 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:12:29,610 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:18 [2020-12-09 11:12:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:12:29,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 11:12:29,772 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:33,093 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2020-12-09 11:12:33,094 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 11:12:33,236 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-12-09 11:12:33,236 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:33,251 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2020-12-09 11:12:33,253 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 11:12:33,523 WARN L197 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2020-12-09 11:12:33,524 INFO L625 ElimStorePlain]: treesize reduction 18, result has 82.2 percent of original size [2020-12-09 11:12:33,543 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2020-12-09 11:12:33,547 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2020-12-09 11:12:33,659 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-12-09 11:12:33,659 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:33,661 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:33,661 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 11:12:33,661 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:12:33,663 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-12-09 11:12:33,663 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:80, output treesize:66 [2020-12-09 11:12:33,664 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:33,664 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 11:12:33,664 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:12:36,025 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:12:36,026 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:36,026 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:36,778 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:36,778 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:12:36,779 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:36,779 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:36,780 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:12:36,781 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:36,781 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:36,782 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-12-09 11:12:36,783 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:36,783 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:36,784 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:36,786 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:36,786 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:36,787 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 11:12:36,789 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:12:36,789 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:36,790 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:36,791 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:12:36,791 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:36,792 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:36,793 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:36,794 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:12:36,794 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:36,795 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:36,796 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-12-09 11:12:36,796 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:36,797 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:36,798 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:36,799 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 11:12:36,801 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:12:36,803 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:36,804 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:36,805 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:12:36,805 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:36,806 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:36,807 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:36,807 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:12:36,807 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:36,809 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:36,809 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:12:36,810 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:36,810 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:36,811 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:12:36,812 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-12-09 11:12:36,812 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:36,813 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:36,814 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-12-09 11:12:36,818 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:36,818 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:36,819 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 11:12:36,822 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:12:36,822 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:36,823 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:36,824 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 11:12:36,825 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 11:12:36,825 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:36,829 INFO L443 ElimStorePlain]: Different costs {3=[|#valid|], 5=[|#length|]} [2020-12-09 11:12:36,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 11:12:36,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 11:12:36,870 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 11:12:36,871 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:36,902 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:36,902 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 11:12:36,903 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:36,937 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:36,937 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 11:12:36,938 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:36,971 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:36,971 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 11:12:36,972 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:37,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 11:12:37,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 11:12:37,013 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 11:12:37,014 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:37,046 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:37,047 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 11:12:37,047 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:37,071 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:37,071 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 11:12:37,072 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:37,237 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-12-09 11:12:37,238 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:37,273 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:37,273 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2020-12-09 11:12:37,274 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:37,276 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:37,276 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:37,277 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:37,296 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2020-12-09 11:12:37,298 INFO L547 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:37,314 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2020-12-09 11:12:37,315 INFO L547 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:37,326 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2020-12-09 11:12:37,327 INFO L547 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:37,354 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:37,354 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2020-12-09 11:12:37,355 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:37,356 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 11:12:37,357 INFO L547 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:37,518 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-12-09 11:12:37,518 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:37,520 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 11:12:37,524 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 11:12:37,526 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2020-12-09 11:12:37,526 INFO L244 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:225, output treesize:14 [2020-12-09 11:12:37,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:12:37,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 11:12:37,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10, 10, 8, 8] total 36 [2020-12-09 11:12:37,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808596033] [2020-12-09 11:12:37,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 37 states [2020-12-09 11:12:37,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 11:12:37,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-12-09 11:12:37,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1133, Unknown=21, NotChecked=0, Total=1332 [2020-12-09 11:12:37,692 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand 37 states. [2020-12-09 11:12:38,599 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2020-12-09 11:12:38,954 WARN L197 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2020-12-09 11:12:39,263 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2020-12-09 11:12:39,616 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 49 [2020-12-09 11:12:41,932 WARN L197 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 63 DAG size of output: 34 [2020-12-09 11:12:42,138 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2020-12-09 11:12:43,103 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 40 [2020-12-09 11:12:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:12:43,875 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2020-12-09 11:12:43,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 11:12:43,876 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 21 [2020-12-09 11:12:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:12:43,877 INFO L225 Difference]: With dead ends: 122 [2020-12-09 11:12:43,877 INFO L226 Difference]: Without dead ends: 122 [2020-12-09 11:12:43,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 71 SyntacticMatches, 14 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 97.7s TimeCoverageRelationStatistics Valid=423, Invalid=1626, Unknown=21, NotChecked=0, Total=2070 [2020-12-09 11:12:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-12-09 11:12:43,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 98. [2020-12-09 11:12:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-12-09 11:12:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2020-12-09 11:12:43,880 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 21 [2020-12-09 11:12:43,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:12:43,880 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2020-12-09 11:12:43,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2020-12-09 11:12:43,880 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2020-12-09 11:12:43,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 11:12:43,881 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:12:43,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:12:44,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 cvc4 --incremental --print-success --lang smt [2020-12-09 11:12:44,483 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:12:44,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:12:44,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1307013042, now seen corresponding path program 1 times [2020-12-09 11:12:44,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 11:12:44,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73450381] [2020-12-09 11:12:44,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2020-12-09 11:12:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:12:44,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 11:12:44,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:12:44,612 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 11:12:44,612 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:44,621 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:44,621 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:12:44,622 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2020-12-09 11:12:44,642 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-12-09 11:12:44,643 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:44,646 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:44,646 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:12:44,646 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2020-12-09 11:12:44,661 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 11:12:44,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 11:12:44,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73450381] [2020-12-09 11:12:44,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:12:44,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 11:12:44,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543543953] [2020-12-09 11:12:44,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 11:12:44,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 11:12:44,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 11:12:44,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 11:12:44,662 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 6 states. [2020-12-09 11:12:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:12:45,116 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2020-12-09 11:12:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 11:12:45,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-12-09 11:12:45,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:12:45,118 INFO L225 Difference]: With dead ends: 110 [2020-12-09 11:12:45,118 INFO L226 Difference]: Without dead ends: 110 [2020-12-09 11:12:45,119 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 11:12:45,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-12-09 11:12:45,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2020-12-09 11:12:45,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-12-09 11:12:45,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2020-12-09 11:12:45,122 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 22 [2020-12-09 11:12:45,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:12:45,122 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2020-12-09 11:12:45,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 11:12:45,122 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2020-12-09 11:12:45,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 11:12:45,123 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:12:45,123 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 11:12:45,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2020-12-09 11:12:45,324 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:12:45,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:12:45,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1862698521, now seen corresponding path program 1 times [2020-12-09 11:12:45,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 11:12:45,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875082797] [2020-12-09 11:12:45,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2020-12-09 11:12:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:12:45,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 11:12:45,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:12:45,475 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 11:12:45,476 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:45,480 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:45,480 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:12:45,480 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 11:12:45,502 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:45,502 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 11:12:45,502 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:45,516 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:45,516 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:12:45,517 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2020-12-09 11:12:45,542 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 11:12:45,543 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:45,557 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:45,558 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:12:45,558 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2020-12-09 11:12:45,593 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 11:12:45,594 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:45,609 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:45,609 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:12:45,610 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:19 [2020-12-09 11:12:45,648 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2020-12-09 11:12:45,649 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:45,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 11:12:45,656 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 11:12:45,656 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:10 [2020-12-09 11:12:45,684 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 11:12:45,685 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 11:12:45,701 INFO L625 ElimStorePlain]: treesize reduction 4, result has 76.5 percent of original size [2020-12-09 11:12:45,702 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 11:12:45,702 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:13 [2020-12-09 11:12:45,738 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 11:12:45,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 11:12:45,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875082797] [2020-12-09 11:12:45,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:12:45,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 11:12:45,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425576022] [2020-12-09 11:12:45,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 11:12:45,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 11:12:45,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 11:12:45,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-09 11:12:45,739 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand 8 states. [2020-12-09 11:13:04,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:13:04,492 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2020-12-09 11:13:04,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 11:13:04,492 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-12-09 11:13:04,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:13:04,493 INFO L225 Difference]: With dead ends: 127 [2020-12-09 11:13:04,493 INFO L226 Difference]: Without dead ends: 127 [2020-12-09 11:13:04,493 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2020-12-09 11:13:04,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-12-09 11:13:04,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2020-12-09 11:13:04,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-12-09 11:13:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2020-12-09 11:13:04,495 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 23 [2020-12-09 11:13:04,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:13:04,495 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2020-12-09 11:13:04,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 11:13:04,495 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2020-12-09 11:13:04,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 11:13:04,496 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:13:04,496 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 11:13:04,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2020-12-09 11:13:04,697 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:13:04,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:13:04,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1862698520, now seen corresponding path program 1 times [2020-12-09 11:13:04,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 11:13:04,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458851659] [2020-12-09 11:13:04,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2020-12-09 11:13:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:13:04,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 11:13:04,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 11:13:04,811 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 11:13:04,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 11:13:04,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458851659] [2020-12-09 11:13:04,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:13:04,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 11:13:04,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981842915] [2020-12-09 11:13:04,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 11:13:04,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 11:13:04,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 11:13:04,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 11:13:04,812 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 4 states. [2020-12-09 11:13:04,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:13:04,939 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2020-12-09 11:13:04,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 11:13:04,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-12-09 11:13:04,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:13:04,940 INFO L225 Difference]: With dead ends: 96 [2020-12-09 11:13:04,940 INFO L226 Difference]: Without dead ends: 96 [2020-12-09 11:13:04,940 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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 11:13:04,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-12-09 11:13:04,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2020-12-09 11:13:04,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-12-09 11:13:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2020-12-09 11:13:04,943 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 23 [2020-12-09 11:13:04,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:13:04,943 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2020-12-09 11:13:04,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 11:13:04,943 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2020-12-09 11:13:04,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 11:13:04,944 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:13:04,944 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] [2020-12-09 11:13:05,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2020-12-09 11:13:05,145 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2020-12-09 11:13:05,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:13:05,146 INFO L82 PathProgramCache]: Analyzing trace with hash 577213201, now seen corresponding path program 1 times [2020-12-09 11:13:05,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 11:13:05,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789154061] [2020-12-09 11:13:05,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f051525-3842-4a59-871e-64218cf7a913/bin/utaipan/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2020-12-09 11:13:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 11:13:05,305 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 11:13:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 11:13:05,377 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 11:13:05,419 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-12-09 11:13:05,419 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 11:13:05,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2020-12-09 11:13:05,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 11:13:05 BoogieIcfgContainer [2020-12-09 11:13:05,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 11:13:05,686 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 11:13:05,686 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 11:13:05,686 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 11:13:05,687 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:10:08" (3/4) ... [2020-12-09 11:13:05,689 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-09 11:13:05,689 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 11:13:05,690 INFO L168 Benchmark]: Toolchain (without parser) took 177657.75 ms. Allocated memory was 65.0 MB in the beginning and 109.1 MB in the end (delta: 44.0 MB). Free memory was 47.1 MB in the beginning and 57.2 MB in the end (delta: -10.1 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. [2020-12-09 11:13:05,690 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 65.0 MB. Free memory is still 47.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 11:13:05,690 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.95 ms. Allocated memory is still 65.0 MB. Free memory was 46.9 MB in the beginning and 35.8 MB in the end (delta: 11.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 11:13:05,690 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.17 ms. Allocated memory is still 65.0 MB. Free memory was 35.8 MB in the beginning and 33.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 11:13:05,690 INFO L168 Benchmark]: Boogie Preprocessor took 27.49 ms. Allocated memory is still 65.0 MB. Free memory was 33.6 MB in the beginning and 31.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 11:13:05,691 INFO L168 Benchmark]: RCFGBuilder took 533.01 ms. Allocated memory was 65.0 MB in the beginning and 90.2 MB in the end (delta: 25.2 MB). Free memory was 31.9 MB in the beginning and 68.2 MB in the end (delta: -36.3 MB). Peak memory consumption was 14.8 MB. Max. memory is 16.1 GB. [2020-12-09 11:13:05,691 INFO L168 Benchmark]: TraceAbstraction took 176738.23 ms. Allocated memory was 90.2 MB in the beginning and 109.1 MB in the end (delta: 18.9 MB). Free memory was 67.4 MB in the beginning and 58.2 MB in the end (delta: 9.2 MB). Peak memory consumption was 27.9 MB. Max. memory is 16.1 GB. [2020-12-09 11:13:05,691 INFO L168 Benchmark]: Witness Printer took 2.91 ms. Allocated memory is still 109.1 MB. Free memory was 58.2 MB in the beginning and 57.2 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 11:13:05,692 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.14 ms. Allocated memory is still 65.0 MB. Free memory is still 47.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 316.95 ms. Allocated memory is still 65.0 MB. Free memory was 46.9 MB in the beginning and 35.8 MB in the end (delta: 11.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 35.17 ms. Allocated memory is still 65.0 MB. Free memory was 35.8 MB in the beginning and 33.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.49 ms. Allocated memory is still 65.0 MB. Free memory was 33.6 MB in the beginning and 31.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 533.01 ms. Allocated memory was 65.0 MB in the beginning and 90.2 MB in the end (delta: 25.2 MB). Free memory was 31.9 MB in the beginning and 68.2 MB in the end (delta: -36.3 MB). Peak memory consumption was 14.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 176738.23 ms. Allocated memory was 90.2 MB in the beginning and 109.1 MB in the end (delta: 18.9 MB). Free memory was 67.4 MB in the beginning and 58.2 MB in the end (delta: 9.2 MB). Peak memory consumption was 27.9 MB. Max. memory is 16.1 GB. * Witness Printer took 2.91 ms. Allocated memory is still 109.1 MB. Free memory was 58.2 MB in the beginning and 57.2 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 539]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 539. Possible FailurePath: [L524] int c = 0; VAL [c=0] [L541] struct item *list = ((void *)0); [L542] int length = 0; VAL [c=0] [L531] c++ [L532] struct item *item = malloc(sizeof *item); VAL [c=1] [L533] EXPR \read(**plist) VAL [c=1] [L533] item->next = *plist VAL [c=1] [L534] EXPR item->next VAL [c=1] [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [c=1] [L534-L536] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [c=1] [L537] *plist = item VAL [c=1] [L545] length++ VAL [c=1] [L546] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L547] COND TRUE length > 0 VAL [c=1] [L548] COND FALSE !(length < 0) VAL [c=1] [L551] EXPR \read(*list) VAL [c=1] [L551] EXPR list->next VAL [c=1] [L551] struct item *next = list->next; [L552] EXPR \read(*list) VAL [c=1] [L552] free(list) VAL [c=1] [L552] free(list) VAL [c=1] [L552] free(list) [L553] list = next VAL [c=1] [L554] length-- VAL [c=1] [L556] COND FALSE !(length > 0) VAL [c=1] [L562] return 0; [L541] struct item *list = ((void *)0); [L562] return 0; VAL [c=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 90 locations, 44 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 176.6s, OverallIterations: 17, TraceHistogramMax: 2, AutomataDifference: 30.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 763 SDtfs, 3877 SDslu, 1420 SDs, 0 SdLazy, 2279 SolverSat, 295 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 24.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 473 GetRequests, 300 SyntacticMatches, 20 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1136 ImplicationChecksByTransitivity, 137.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 417 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 139.1s InterpolantComputationTime, 352 NumberOfCodeBlocks, 352 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 425 ConstructedInterpolants, 101 QuantifiedInterpolants, 136653 SizeOfPredicates, 238 NumberOfNonLiveVariables, 1987 ConjunctsInSsa, 244 ConjunctsInUnsatCore, 26 InterpolantComputations, 14 PerfectInterpolantSequences, 12/72 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...