./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:01:08,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:01:08,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:01:08,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:01:08,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:01:08,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:01:08,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:01:08,990 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:01:08,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:01:08,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:01:08,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:01:08,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:01:08,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:01:08,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:01:09,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:01:09,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:01:09,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:01:09,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:01:09,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:01:09,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:01:09,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:01:09,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:01:09,021 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:01:09,022 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:01:09,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:01:09,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:01:09,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:01:09,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:01:09,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:01:09,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:01:09,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:01:09,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:01:09,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:01:09,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:01:09,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:01:09,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:01:09,037 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:01:09,037 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:01:09,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:01:09,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:01:09,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:01:09,042 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2019-11-26 02:01:09,067 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:01:09,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:01:09,068 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:01:09,068 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:01:09,069 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:01:09,069 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:01:09,069 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:01:09,069 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:01:09,069 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:01:09,069 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:01:09,070 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:01:09,070 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:01:09,070 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:01:09,070 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:01:09,070 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:01:09,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:01:09,071 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 02:01:09,071 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:01:09,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:01:09,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:01:09,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:01:09,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:01:09,072 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-26 02:01:09,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:01:09,073 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:01:09,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:01:09,073 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:01:09,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:01:09,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:01:09,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:01:09,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:01:09,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:01:09,074 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:01:09,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:01:09,074 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:01:09,075 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:01:09,075 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_87deaa5b-e455-4521-925c-2e8c90c8e090/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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d [2019-11-26 02:01:09,252 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:01:09,268 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:01:09,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:01:09,272 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:01:09,272 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:01:09,273 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/bin/utaipan/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-11-26 02:01:09,336 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/bin/utaipan/data/241271d14/30af0d664efc44fe9fda0cb1238d76da/FLAG87f5102ae [2019-11-26 02:01:09,697 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:01:09,697 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-11-26 02:01:09,703 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/bin/utaipan/data/241271d14/30af0d664efc44fe9fda0cb1238d76da/FLAG87f5102ae [2019-11-26 02:01:09,715 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/bin/utaipan/data/241271d14/30af0d664efc44fe9fda0cb1238d76da [2019-11-26 02:01:09,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:01:09,718 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:01:09,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:01:09,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:01:09,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:01:09,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:01:09" (1/1) ... [2019-11-26 02:01:09,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c23547a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:01:09, skipping insertion in model container [2019-11-26 02:01:09,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:01:09" (1/1) ... [2019-11-26 02:01:09,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:01:09,747 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:01:09,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:01:09,890 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:01:09,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:01:09,993 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:01:09,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:01:09 WrapperNode [2019-11-26 02:01:09,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:01:09,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:01:09,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:01:09,995 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:01:10,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:01:09" (1/1) ... [2019-11-26 02:01:10,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:01:09" (1/1) ... [2019-11-26 02:01:10,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:01:10,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:01:10,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:01:10,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:01:10,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:01:09" (1/1) ... [2019-11-26 02:01:10,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:01:09" (1/1) ... [2019-11-26 02:01:10,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:01:09" (1/1) ... [2019-11-26 02:01:10,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:01:09" (1/1) ... [2019-11-26 02:01:10,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:01:09" (1/1) ... [2019-11-26 02:01:10,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:01:09" (1/1) ... [2019-11-26 02:01:10,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:01:09" (1/1) ... [2019-11-26 02:01:10,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:01:10,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:01:10,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:01:10,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:01:10,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:01:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/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 [2019-11-26 02:01:10,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:01:10,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:01:10,482 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:01:10,482 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:01:10,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:01:10 BoogieIcfgContainer [2019-11-26 02:01:10,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:01:10,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:01:10,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:01:10,487 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:01:10,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:01:09" (1/3) ... [2019-11-26 02:01:10,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d677827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:01:10, skipping insertion in model container [2019-11-26 02:01:10,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:01:09" (2/3) ... [2019-11-26 02:01:10,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d677827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:01:10, skipping insertion in model container [2019-11-26 02:01:10,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:01:10" (3/3) ... [2019-11-26 02:01:10,492 INFO L109 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-11-26 02:01:10,501 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:01:10,514 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-26 02:01:10,525 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-26 02:01:10,555 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:01:10,555 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:01:10,555 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:01:10,555 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:01:10,556 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:01:10,556 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:01:10,556 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:01:10,556 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:01:10,578 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-11-26 02:01:10,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-26 02:01:10,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:01:10,584 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-26 02:01:10,584 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:01:10,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:01:10,590 INFO L82 PathProgramCache]: Analyzing trace with hash 29686488, now seen corresponding path program 1 times [2019-11-26 02:01:10,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:01:10,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730070292] [2019-11-26 02:01:10,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:01:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:10,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730070292] [2019-11-26 02:01:10,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:01:10,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:01:10,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035722536] [2019-11-26 02:01:10,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:01:10,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:01:10,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:01:10,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:01:10,769 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-11-26 02:01:10,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:01:10,847 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2019-11-26 02:01:10,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:01:10,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-26 02:01:10,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:01:10,856 INFO L225 Difference]: With dead ends: 66 [2019-11-26 02:01:10,856 INFO L226 Difference]: Without dead ends: 40 [2019-11-26 02:01:10,859 INFO L630 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 [2019-11-26 02:01:10,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-26 02:01:10,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2019-11-26 02:01:10,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-26 02:01:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-11-26 02:01:10,889 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 5 [2019-11-26 02:01:10,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:01:10,889 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-26 02:01:10,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:01:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-11-26 02:01:10,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-26 02:01:10,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:01:10,890 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-26 02:01:10,891 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:01:10,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:01:10,891 INFO L82 PathProgramCache]: Analyzing trace with hash 29685034, now seen corresponding path program 1 times [2019-11-26 02:01:10,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:01:10,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006679539] [2019-11-26 02:01:10,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:01:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:10,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:10,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006679539] [2019-11-26 02:01:10,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:01:10,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:01:10,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891338642] [2019-11-26 02:01:10,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:01:10,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:01:10,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:01:10,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:01:10,927 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2019-11-26 02:01:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:01:10,966 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2019-11-26 02:01:10,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:01:10,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-26 02:01:10,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:01:10,968 INFO L225 Difference]: With dead ends: 34 [2019-11-26 02:01:10,968 INFO L226 Difference]: Without dead ends: 33 [2019-11-26 02:01:10,969 INFO L630 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 [2019-11-26 02:01:10,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-26 02:01:10,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-11-26 02:01:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-26 02:01:10,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-26 02:01:10,975 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 5 [2019-11-26 02:01:10,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:01:10,975 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-26 02:01:10,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:01:10,975 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-11-26 02:01:10,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-26 02:01:10,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:01:10,976 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-26 02:01:10,976 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:01:10,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:01:10,976 INFO L82 PathProgramCache]: Analyzing trace with hash 920281212, now seen corresponding path program 1 times [2019-11-26 02:01:10,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:01:10,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838195885] [2019-11-26 02:01:10,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:01:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:11,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:11,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838195885] [2019-11-26 02:01:11,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:01:11,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:01:11,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996615431] [2019-11-26 02:01:11,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:01:11,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:01:11,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:01:11,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:01:11,004 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2019-11-26 02:01:11,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:01:11,031 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-11-26 02:01:11,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:01:11,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-26 02:01:11,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:01:11,037 INFO L225 Difference]: With dead ends: 45 [2019-11-26 02:01:11,037 INFO L226 Difference]: Without dead ends: 44 [2019-11-26 02:01:11,037 INFO L630 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 [2019-11-26 02:01:11,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-26 02:01:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-11-26 02:01:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-26 02:01:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-11-26 02:01:11,043 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 6 [2019-11-26 02:01:11,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:01:11,044 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-11-26 02:01:11,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:01:11,044 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2019-11-26 02:01:11,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-26 02:01:11,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:01:11,047 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-26 02:01:11,047 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:01:11,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:01:11,047 INFO L82 PathProgramCache]: Analyzing trace with hash 920236110, now seen corresponding path program 1 times [2019-11-26 02:01:11,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:01:11,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430097541] [2019-11-26 02:01:11,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:01:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:11,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:11,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430097541] [2019-11-26 02:01:11,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:01:11,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:01:11,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859586318] [2019-11-26 02:01:11,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:01:11,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:01:11,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:01:11,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:01:11,093 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 3 states. [2019-11-26 02:01:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:01:11,111 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2019-11-26 02:01:11,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:01:11,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-26 02:01:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:01:11,112 INFO L225 Difference]: With dead ends: 31 [2019-11-26 02:01:11,113 INFO L226 Difference]: Without dead ends: 30 [2019-11-26 02:01:11,113 INFO L630 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 [2019-11-26 02:01:11,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-26 02:01:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-26 02:01:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-26 02:01:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-26 02:01:11,119 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 6 [2019-11-26 02:01:11,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:01:11,119 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-26 02:01:11,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:01:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-26 02:01:11,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:01:11,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:01:11,120 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:01:11,120 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:01:11,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:01:11,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1537451600, now seen corresponding path program 1 times [2019-11-26 02:01:11,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:01:11,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682034430] [2019-11-26 02:01:11,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:01:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:11,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682034430] [2019-11-26 02:01:11,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:01:11,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-26 02:01:11,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204622426] [2019-11-26 02:01:11,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:01:11,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:01:11,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:01:11,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:01:11,170 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 3 states. [2019-11-26 02:01:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:01:11,189 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-11-26 02:01:11,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:01:11,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-26 02:01:11,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:01:11,191 INFO L225 Difference]: With dead ends: 30 [2019-11-26 02:01:11,191 INFO L226 Difference]: Without dead ends: 29 [2019-11-26 02:01:11,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:01:11,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-26 02:01:11,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-26 02:01:11,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-26 02:01:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-11-26 02:01:11,197 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2019-11-26 02:01:11,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:01:11,197 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-11-26 02:01:11,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:01:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-11-26 02:01:11,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 02:01:11,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:01:11,198 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:01:11,198 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:01:11,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:01:11,198 INFO L82 PathProgramCache]: Analyzing trace with hash -416359280, now seen corresponding path program 1 times [2019-11-26 02:01:11,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:01:11,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433644477] [2019-11-26 02:01:11,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:01:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:11,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433644477] [2019-11-26 02:01:11,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:01:11,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:01:11,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511882497] [2019-11-26 02:01:11,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:01:11,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:01:11,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:01:11,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:01:11,224 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 3 states. [2019-11-26 02:01:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:01:11,241 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-11-26 02:01:11,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:01:11,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-26 02:01:11,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:01:11,245 INFO L225 Difference]: With dead ends: 29 [2019-11-26 02:01:11,246 INFO L226 Difference]: Without dead ends: 28 [2019-11-26 02:01:11,246 INFO L630 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 [2019-11-26 02:01:11,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-26 02:01:11,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-26 02:01:11,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-26 02:01:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-11-26 02:01:11,251 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 8 [2019-11-26 02:01:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:01:11,251 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-26 02:01:11,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:01:11,252 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-11-26 02:01:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:01:11,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:01:11,252 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-26 02:01:11,253 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:01:11,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:01:11,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1321380767, now seen corresponding path program 1 times [2019-11-26 02:01:11,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:01:11,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969328747] [2019-11-26 02:01:11,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:01:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:11,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:11,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969328747] [2019-11-26 02:01:11,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102093410] [2019-11-26 02:01:11,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/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 [2019-11-26 02:01:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:11,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:01:11,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:01:11,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:11,375 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:01:11,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:11,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1943479638] [2019-11-26 02:01:11,414 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-11-26 02:01:11,414 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:01:11,418 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:01:11,424 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:01:11,424 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:01:11,663 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:01:11,903 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2019-11-26 02:01:12,113 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:01:12,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:01:12,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-11-26 02:01:12,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228843971] [2019-11-26 02:01:12,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:01:12,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:01:12,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:01:12,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:01:12,116 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 6 states. [2019-11-26 02:01:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:01:12,188 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2019-11-26 02:01:12,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:01:12,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-26 02:01:12,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:01:12,191 INFO L225 Difference]: With dead ends: 81 [2019-11-26 02:01:12,191 INFO L226 Difference]: Without dead ends: 80 [2019-11-26 02:01:12,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:01:12,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-26 02:01:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 40. [2019-11-26 02:01:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-26 02:01:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2019-11-26 02:01:12,200 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 9 [2019-11-26 02:01:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:01:12,201 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2019-11-26 02:01:12,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:01:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2019-11-26 02:01:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:01:12,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:01:12,202 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:01:12,407 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:01:12,407 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:01:12,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:01:12,408 INFO L82 PathProgramCache]: Analyzing trace with hash -689307342, now seen corresponding path program 1 times [2019-11-26 02:01:12,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:01:12,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171173749] [2019-11-26 02:01:12,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:01:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:12,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171173749] [2019-11-26 02:01:12,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:01:12,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:01:12,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576606259] [2019-11-26 02:01:12,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:01:12,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:01:12,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:01:12,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:01:12,444 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand 4 states. [2019-11-26 02:01:12,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:01:12,527 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2019-11-26 02:01:12,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:01:12,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-26 02:01:12,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:01:12,528 INFO L225 Difference]: With dead ends: 72 [2019-11-26 02:01:12,529 INFO L226 Difference]: Without dead ends: 70 [2019-11-26 02:01:12,529 INFO L630 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 [2019-11-26 02:01:12,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-26 02:01:12,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 50. [2019-11-26 02:01:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-26 02:01:12,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2019-11-26 02:01:12,537 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 10 [2019-11-26 02:01:12,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:01:12,537 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2019-11-26 02:01:12,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:01:12,537 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2019-11-26 02:01:12,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 02:01:12,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:01:12,541 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:01:12,541 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:01:12,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:01:12,542 INFO L82 PathProgramCache]: Analyzing trace with hash 106308951, now seen corresponding path program 1 times [2019-11-26 02:01:12,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:01:12,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925129450] [2019-11-26 02:01:12,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:01:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:12,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925129450] [2019-11-26 02:01:12,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:01:12,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:01:12,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116203457] [2019-11-26 02:01:12,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:01:12,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:01:12,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:01:12,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:01:12,590 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 4 states. [2019-11-26 02:01:12,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:01:12,642 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2019-11-26 02:01:12,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:01:12,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-26 02:01:12,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:01:12,644 INFO L225 Difference]: With dead ends: 54 [2019-11-26 02:01:12,644 INFO L226 Difference]: Without dead ends: 52 [2019-11-26 02:01:12,644 INFO L630 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 [2019-11-26 02:01:12,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-26 02:01:12,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2019-11-26 02:01:12,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-26 02:01:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-11-26 02:01:12,655 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 11 [2019-11-26 02:01:12,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:01:12,656 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-11-26 02:01:12,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:01:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-11-26 02:01:12,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-26 02:01:12,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:01:12,658 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:01:12,660 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:01:12,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:01:12,661 INFO L82 PathProgramCache]: Analyzing trace with hash -999444228, now seen corresponding path program 1 times [2019-11-26 02:01:12,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:01:12,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788613647] [2019-11-26 02:01:12,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:01:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:12,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788613647] [2019-11-26 02:01:12,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631640399] [2019-11-26 02:01:12,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/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 [2019-11-26 02:01:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:12,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:01:12,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:01:12,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:12,750 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:01:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:12,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [785959155] [2019-11-26 02:01:12,771 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-11-26 02:01:12,771 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:01:12,771 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:01:12,772 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:01:12,772 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:01:12,968 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:01:13,337 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2019-11-26 02:01:13,553 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2019-11-26 02:01:13,732 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:01:13,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:01:13,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-11-26 02:01:13,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571388780] [2019-11-26 02:01:13,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:01:13,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:01:13,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:01:13,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-26 02:01:13,734 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 6 states. [2019-11-26 02:01:13,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:01:13,776 INFO L93 Difference]: Finished difference Result 118 states and 145 transitions. [2019-11-26 02:01:13,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:01:13,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-26 02:01:13,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:01:13,778 INFO L225 Difference]: With dead ends: 118 [2019-11-26 02:01:13,778 INFO L226 Difference]: Without dead ends: 117 [2019-11-26 02:01:13,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-26 02:01:13,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-26 02:01:13,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2019-11-26 02:01:13,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-26 02:01:13,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2019-11-26 02:01:13,803 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 12 [2019-11-26 02:01:13,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:01:13,804 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2019-11-26 02:01:13,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:01:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2019-11-26 02:01:13,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-26 02:01:13,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:01:13,805 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:01:14,008 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:01:14,009 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:01:14,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:01:14,009 INFO L82 PathProgramCache]: Analyzing trace with hash -930171701, now seen corresponding path program 1 times [2019-11-26 02:01:14,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:01:14,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030704387] [2019-11-26 02:01:14,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:01:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:01:14,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030704387] [2019-11-26 02:01:14,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:01:14,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:01:14,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975541385] [2019-11-26 02:01:14,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:01:14,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:01:14,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:01:14,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:01:14,034 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand 4 states. [2019-11-26 02:01:14,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:01:14,058 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2019-11-26 02:01:14,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:01:14,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-26 02:01:14,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:01:14,060 INFO L225 Difference]: With dead ends: 94 [2019-11-26 02:01:14,060 INFO L226 Difference]: Without dead ends: 93 [2019-11-26 02:01:14,060 INFO L630 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 [2019-11-26 02:01:14,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-26 02:01:14,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2019-11-26 02:01:14,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-26 02:01:14,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 111 transitions. [2019-11-26 02:01:14,069 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 111 transitions. Word has length 14 [2019-11-26 02:01:14,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:01:14,069 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 111 transitions. [2019-11-26 02:01:14,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:01:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2019-11-26 02:01:14,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-26 02:01:14,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:01:14,071 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:01:14,071 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:01:14,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:01:14,071 INFO L82 PathProgramCache]: Analyzing trace with hash -541857789, now seen corresponding path program 1 times [2019-11-26 02:01:14,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:01:14,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896126829] [2019-11-26 02:01:14,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:01:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:14,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:14,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896126829] [2019-11-26 02:01:14,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087059203] [2019-11-26 02:01:14,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:01:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:14,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:01:14,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:01:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:14,200 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:01:14,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:14,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [863488069] [2019-11-26 02:01:14,242 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-11-26 02:01:14,243 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:01:14,243 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:01:14,243 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:01:14,243 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:01:14,538 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:01:14,680 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-11-26 02:01:14,936 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-11-26 02:01:15,089 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-11-26 02:01:15,251 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-11-26 02:01:15,562 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:01:15,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:01:15,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2019-11-26 02:01:15,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603903208] [2019-11-26 02:01:15,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 02:01:15,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:01:15,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 02:01:15,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-11-26 02:01:15,564 INFO L87 Difference]: Start difference. First operand 89 states and 111 transitions. Second operand 12 states. [2019-11-26 02:01:16,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:01:16,009 INFO L93 Difference]: Finished difference Result 189 states and 226 transitions. [2019-11-26 02:01:16,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-26 02:01:16,010 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-11-26 02:01:16,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:01:16,011 INFO L225 Difference]: With dead ends: 189 [2019-11-26 02:01:16,011 INFO L226 Difference]: Without dead ends: 146 [2019-11-26 02:01:16,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=154, Invalid=968, Unknown=0, NotChecked=0, Total=1122 [2019-11-26 02:01:16,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-26 02:01:16,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 94. [2019-11-26 02:01:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-26 02:01:16,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2019-11-26 02:01:16,023 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 16 [2019-11-26 02:01:16,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:01:16,023 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2019-11-26 02:01:16,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 02:01:16,024 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2019-11-26 02:01:16,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-26 02:01:16,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:01:16,025 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:01:16,232 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:01:16,233 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:01:16,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:01:16,233 INFO L82 PathProgramCache]: Analyzing trace with hash -735760783, now seen corresponding path program 2 times [2019-11-26 02:01:16,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:01:16,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736161317] [2019-11-26 02:01:16,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:01:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:16,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:16,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736161317] [2019-11-26 02:01:16,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520190438] [2019-11-26 02:01:16,330 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:01:16,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-11-26 02:01:16,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:01:16,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:01:16,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:01:16,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:01:16,426 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:01:16,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:01:16,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1472880681] [2019-11-26 02:01:16,432 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-11-26 02:01:16,432 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:01:16,432 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:01:16,432 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:01:16,432 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:01:16,724 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:01:16,862 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-11-26 02:01:17,086 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-11-26 02:01:17,223 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-11-26 02:01:17,575 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-11-26 02:01:17,725 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-11-26 02:01:17,726 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:01:17,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:01:17,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 2, 2] total 9 [2019-11-26 02:01:17,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210054966] [2019-11-26 02:01:17,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 02:01:17,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:01:17,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 02:01:17,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2019-11-26 02:01:17,727 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand 11 states. [2019-11-26 02:01:18,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:01:18,264 INFO L93 Difference]: Finished difference Result 146 states and 172 transitions. [2019-11-26 02:01:18,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-26 02:01:18,264 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-11-26 02:01:18,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:01:18,265 INFO L225 Difference]: With dead ends: 146 [2019-11-26 02:01:18,265 INFO L226 Difference]: Without dead ends: 121 [2019-11-26 02:01:18,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=237, Invalid=1095, Unknown=0, NotChecked=0, Total=1332 [2019-11-26 02:01:18,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-26 02:01:18,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 77. [2019-11-26 02:01:18,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-26 02:01:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2019-11-26 02:01:18,277 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 16 [2019-11-26 02:01:18,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:01:18,278 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2019-11-26 02:01:18,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 02:01:18,278 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2019-11-26 02:01:18,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 02:01:18,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:01:18,279 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:01:18,479 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:01:18,480 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:01:18,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:01:18,480 INFO L82 PathProgramCache]: Analyzing trace with hash 471236851, now seen corresponding path program 1 times [2019-11-26 02:01:18,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:01:18,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411827041] [2019-11-26 02:01:18,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:01:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:18,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411827041] [2019-11-26 02:01:18,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119578553] [2019-11-26 02:01:18,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:01:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:18,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:01:18,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:01:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:18,553 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:01:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:18,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2021790928] [2019-11-26 02:01:18,594 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-11-26 02:01:18,594 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:01:18,594 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:01:18,594 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:01:18,595 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:01:18,777 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:01:19,613 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:01:19,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:01:19,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-11-26 02:01:19,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592754301] [2019-11-26 02:01:19,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:01:19,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:01:19,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:01:19,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-11-26 02:01:19,615 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 10 states. [2019-11-26 02:01:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:01:19,993 INFO L93 Difference]: Finished difference Result 442 states and 524 transitions. [2019-11-26 02:01:19,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-26 02:01:19,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-26 02:01:19,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:01:19,999 INFO L225 Difference]: With dead ends: 442 [2019-11-26 02:01:19,999 INFO L226 Difference]: Without dead ends: 441 [2019-11-26 02:01:20,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2019-11-26 02:01:20,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-11-26 02:01:20,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 200. [2019-11-26 02:01:20,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-26 02:01:20,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 244 transitions. [2019-11-26 02:01:20,020 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 244 transitions. Word has length 17 [2019-11-26 02:01:20,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:01:20,021 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 244 transitions. [2019-11-26 02:01:20,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:01:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 244 transitions. [2019-11-26 02:01:20,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 02:01:20,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:01:20,027 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:01:20,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:01:20,239 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:01:20,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:01:20,239 INFO L82 PathProgramCache]: Analyzing trace with hash 467352042, now seen corresponding path program 2 times [2019-11-26 02:01:20,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:01:20,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735062732] [2019-11-26 02:01:20,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:01:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:20,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735062732] [2019-11-26 02:01:20,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322327588] [2019-11-26 02:01:20,307 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:01:20,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-26 02:01:20,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:01:20,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:01:20,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:01:20,388 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-26 02:01:20,388 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:01:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-26 02:01:20,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1597150093] [2019-11-26 02:01:20,420 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-11-26 02:01:20,420 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:01:20,420 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:01:20,420 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:01:20,421 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:01:20,607 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:01:21,459 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:01:21,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:01:21,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 12 [2019-11-26 02:01:21,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830984272] [2019-11-26 02:01:21,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-26 02:01:21,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:01:21,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-26 02:01:21,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2019-11-26 02:01:21,460 INFO L87 Difference]: Start difference. First operand 200 states and 244 transitions. Second operand 13 states. [2019-11-26 02:01:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:01:22,047 INFO L93 Difference]: Finished difference Result 699 states and 853 transitions. [2019-11-26 02:01:22,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-26 02:01:22,050 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-11-26 02:01:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:01:22,054 INFO L225 Difference]: With dead ends: 699 [2019-11-26 02:01:22,054 INFO L226 Difference]: Without dead ends: 698 [2019-11-26 02:01:22,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 64 SyntacticMatches, 17 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=504, Invalid=1658, Unknown=0, NotChecked=0, Total=2162 [2019-11-26 02:01:22,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-11-26 02:01:22,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 244. [2019-11-26 02:01:22,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-11-26 02:01:22,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 300 transitions. [2019-11-26 02:01:22,077 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 300 transitions. Word has length 32 [2019-11-26 02:01:22,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:01:22,078 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 300 transitions. [2019-11-26 02:01:22,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-26 02:01:22,078 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 300 transitions. [2019-11-26 02:01:22,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-26 02:01:22,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:01:22,079 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-11-26 02:01:22,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:01:22,282 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:01:22,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:01:22,283 INFO L82 PathProgramCache]: Analyzing trace with hash -538753878, now seen corresponding path program 2 times [2019-11-26 02:01:22,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:01:22,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392072249] [2019-11-26 02:01:22,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:01:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:01:22,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392072249] [2019-11-26 02:01:22,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470353626] [2019-11-26 02:01:22,322 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:01:22,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-11-26 02:01:22,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:01:22,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:01:22,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:01:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-26 02:01:22,376 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:01:22,392 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-26 02:01:22,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [871913088] [2019-11-26 02:01:22,393 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-11-26 02:01:22,393 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:01:22,393 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:01:22,393 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:01:22,394 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:01:22,484 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:01:22,740 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2019-11-26 02:01:22,883 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2019-11-26 02:01:23,109 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:01:23,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:01:23,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 2, 2] total 8 [2019-11-26 02:01:23,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134363601] [2019-11-26 02:01:23,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 02:01:23,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:01:23,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 02:01:23,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-11-26 02:01:23,111 INFO L87 Difference]: Start difference. First operand 244 states and 300 transitions. Second operand 9 states. [2019-11-26 02:01:23,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:01:23,243 INFO L93 Difference]: Finished difference Result 417 states and 504 transitions. [2019-11-26 02:01:23,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 02:01:23,249 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-11-26 02:01:23,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:01:23,251 INFO L225 Difference]: With dead ends: 417 [2019-11-26 02:01:23,251 INFO L226 Difference]: Without dead ends: 416 [2019-11-26 02:01:23,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 79 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-11-26 02:01:23,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-11-26 02:01:23,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 76. [2019-11-26 02:01:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-26 02:01:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2019-11-26 02:01:23,264 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 33 [2019-11-26 02:01:23,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:01:23,266 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2019-11-26 02:01:23,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 02:01:23,266 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2019-11-26 02:01:23,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-26 02:01:23,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:01:23,270 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2019-11-26 02:01:23,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:01:23,481 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:01:23,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:01:23,481 INFO L82 PathProgramCache]: Analyzing trace with hash -738627734, now seen corresponding path program 1 times [2019-11-26 02:01:23,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:01:23,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387840988] [2019-11-26 02:01:23,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:01:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 16 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:01:23,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387840988] [2019-11-26 02:01:23,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533912625] [2019-11-26 02:01:23,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:01:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:23,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:01:23,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:01:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-26 02:01:23,663 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:01:23,700 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-26 02:01:23,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:01:23,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [13] total 20 [2019-11-26 02:01:23,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013661835] [2019-11-26 02:01:23,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:01:23,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:01:23,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:01:23,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-11-26 02:01:23,702 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand 8 states. [2019-11-26 02:01:23,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:01:23,787 INFO L93 Difference]: Finished difference Result 193 states and 226 transitions. [2019-11-26 02:01:23,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:01:23,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-11-26 02:01:23,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:01:23,788 INFO L225 Difference]: With dead ends: 193 [2019-11-26 02:01:23,788 INFO L226 Difference]: Without dead ends: 132 [2019-11-26 02:01:23,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2019-11-26 02:01:23,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-26 02:01:23,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 87. [2019-11-26 02:01:23,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-26 02:01:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2019-11-26 02:01:23,800 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 44 [2019-11-26 02:01:23,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:01:23,800 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2019-11-26 02:01:23,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:01:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2019-11-26 02:01:23,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-26 02:01:23,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:01:23,801 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2019-11-26 02:01:24,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:01:24,004 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:01:24,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:01:24,004 INFO L82 PathProgramCache]: Analyzing trace with hash -37887510, now seen corresponding path program 2 times [2019-11-26 02:01:24,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:01:24,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827809115] [2019-11-26 02:01:24,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:01:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:01:24,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827809115] [2019-11-26 02:01:24,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128701123] [2019-11-26 02:01:24,109 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:01:24,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-26 02:01:24,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:01:24,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:01:24,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:01:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-26 02:01:24,206 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:01:24,232 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-26 02:01:24,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [984535903] [2019-11-26 02:01:24,234 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-11-26 02:01:24,234 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:01:24,234 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:01:24,234 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:01:24,234 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:01:24,523 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:01:25,396 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:01:25,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:01:25,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3, 3] total 13 [2019-11-26 02:01:25,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934201790] [2019-11-26 02:01:25,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 02:01:25,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:01:25,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 02:01:25,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2019-11-26 02:01:25,397 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 14 states. [2019-11-26 02:01:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:01:25,799 INFO L93 Difference]: Finished difference Result 187 states and 207 transitions. [2019-11-26 02:01:25,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-26 02:01:25,799 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2019-11-26 02:01:25,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:01:25,800 INFO L225 Difference]: With dead ends: 187 [2019-11-26 02:01:25,800 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:01:25,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 104 SyntacticMatches, 15 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=417, Invalid=1475, Unknown=0, NotChecked=0, Total=1892 [2019-11-26 02:01:25,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:01:25,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:01:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:01:25,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:01:25,802 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2019-11-26 02:01:25,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:01:25,804 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:01:25,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 02:01:25,804 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:01:25,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:01:26,008 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:01:26,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:01:26,141 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 143 [2019-11-26 02:01:26,339 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 152 [2019-11-26 02:01:26,840 WARN L192 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 315 DAG size of output: 291 [2019-11-26 02:01:27,349 WARN L192 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 34 [2019-11-26 02:01:27,944 WARN L192 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 40 [2019-11-26 02:01:28,674 WARN L192 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 286 DAG size of output: 30 [2019-11-26 02:01:28,676 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-11-26 02:01:28,676 INFO L440 ceAbstractionStarter]: At program point L23-2(lines 23 34) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~m~0 2147483647)) (.cse5 (<= ULTIMATE.start_main_~n~0 2147483647)) (.cse2 (<= 0 ULTIMATE.start_main_~N~0)) (.cse6 (<= ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~j~0)) (.cse7 (<= 0 ULTIMATE.start_main_~j~0)) (.cse3 (<= ULTIMATE.start_main_~N~0 2147483647)) (.cse4 (<= 0 ULTIMATE.start_main_~i~0))) (or (let ((.cse1 (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~i~0))) (and (<= ULTIMATE.start_main_~i~0 0) .cse0 (<= .cse1 (+ ULTIMATE.start_main_~m~0 2147483647)) .cse2 (<= .cse1 2147483647) .cse3 .cse4)) (and .cse5 .cse0 .cse2 (<= ULTIMATE.start_main_~N~0 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1)) .cse6 .cse7 .cse3 .cse4) (and .cse5 (<= ULTIMATE.start_main_~j~0 0) .cse2 .cse6 .cse7 .cse3 .cse4))) [2019-11-26 02:01:28,676 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2019-11-26 02:01:28,676 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-11-26 02:01:28,676 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:01:28,677 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2019-11-26 02:01:28,677 INFO L444 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2019-11-26 02:01:28,677 INFO L444 ceAbstractionStarter]: For program point L28-2(lines 28 30) no Hoare annotation was computed. [2019-11-26 02:01:28,677 INFO L440 ceAbstractionStarter]: At program point L28-4(lines 28 30) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~n~0 2147483647)) (.cse1 (<= ULTIMATE.start_main_~m~0 2147483647)) (.cse2 (<= 0 ULTIMATE.start_main_~k~0)) (.cse3 (<= 0 ULTIMATE.start_main_~N~0)) (.cse4 (<= 0 ULTIMATE.start_main_~j~0)) (.cse5 (<= ULTIMATE.start_main_~k~0 2147483646)) (.cse6 (<= ULTIMATE.start_main_~N~0 2147483647)) (.cse7 (<= 0 ULTIMATE.start_main_~i~0))) (or (and (<= ULTIMATE.start_main_~i~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~i~0 1)) (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1)) .cse4 .cse5 .cse6 .cse7))) [2019-11-26 02:01:28,677 INFO L444 ceAbstractionStarter]: For program point L28-5(lines 28 30) no Hoare annotation was computed. [2019-11-26 02:01:28,677 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-11-26 02:01:28,677 INFO L444 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-26 02:01:28,677 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:01:28,677 INFO L444 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-11-26 02:01:28,677 INFO L444 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2019-11-26 02:01:28,677 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2019-11-26 02:01:28,678 INFO L440 ceAbstractionStarter]: At program point L25-2(lines 25 32) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1))) (.cse1 (<= ULTIMATE.start_main_~m~0 2147483647)) (.cse0 (<= ULTIMATE.start_main_~n~0 2147483647)) (.cse2 (<= 0 ULTIMATE.start_main_~N~0)) (.cse3 (<= ULTIMATE.start_main_~j~0 0)) (.cse5 (<= 0 ULTIMATE.start_main_~j~0)) (.cse6 (<= ULTIMATE.start_main_~i~0 2147483646)) (.cse8 (<= ULTIMATE.start_main_~N~0 2147483647)) (.cse7 (<= 0 ULTIMATE.start_main_~i~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_main_~N~0 ULTIMATE.start_main_~i~0) .cse4 .cse5 .cse6) (and .cse0 .cse1 (<= 0 ULTIMATE.start_main_~k~0) .cse2 (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~i~0 1)) .cse4 .cse5 (<= ULTIMATE.start_main_~k~0 2147483646) .cse6 .cse7) (and (<= ULTIMATE.start_main_~i~0 0) .cse1 .cse3 .cse2 .cse5 (<= (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~j~0 2147483647)) .cse8 .cse7) (and .cse0 (<= ULTIMATE.start_main_~m~0 0) .cse2 .cse3 .cse5 .cse6 .cse8 .cse7))) [2019-11-26 02:01:28,678 INFO L444 ceAbstractionStarter]: For program point L25-3(lines 25 32) no Hoare annotation was computed. [2019-11-26 02:01:28,678 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 35) no Hoare annotation was computed. [2019-11-26 02:01:28,678 INFO L447 ceAbstractionStarter]: At program point L21-1(lines 21 35) the Hoare annotation is: true [2019-11-26 02:01:28,678 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-11-26 02:01:28,678 INFO L444 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2019-11-26 02:01:28,678 INFO L444 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-11-26 02:01:28,678 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2019-11-26 02:01:28,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:01:28 BoogieIcfgContainer [2019-11-26 02:01:28,695 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:01:28,695 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:01:28,695 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:01:28,696 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:01:28,696 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:01:10" (3/4) ... [2019-11-26 02:01:28,699 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:01:28,707 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-26 02:01:28,708 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-26 02:01:28,708 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:01:28,749 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_87deaa5b-e455-4521-925c-2e8c90c8e090/bin/utaipan/witness.graphml [2019-11-26 02:01:28,749 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:01:28,750 INFO L168 Benchmark]: Toolchain (without parser) took 19032.02 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 413.7 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -275.0 MB). Peak memory consumption was 138.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:01:28,750 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:01:28,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:01:28,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:01:28,752 INFO L168 Benchmark]: Boogie Preprocessor took 35.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:01:28,752 INFO L168 Benchmark]: RCFGBuilder took 419.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:01:28,752 INFO L168 Benchmark]: TraceAbstraction took 18211.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 275.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -130.1 MB). Peak memory consumption was 520.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:01:28,753 INFO L168 Benchmark]: Witness Printer took 53.73 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:01:28,755 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 274.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 419.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18211.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 275.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -130.1 MB). Peak memory consumption was 520.0 MB. Max. memory is 11.5 GB. * Witness Printer took 53.73 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((i <= 0 && m <= 2147483647) && n + i <= m + 2147483647) && 0 <= N) && n + i <= 2147483647) && N <= 2147483647) && 0 <= i) || ((((((((n <= 2147483647 && m <= 2147483647) && 0 <= N) && N <= i) && N <= k + 1) && m <= j) && 0 <= j) && N <= 2147483647) && 0 <= i)) || ((((((n <= 2147483647 && j <= 0) && 0 <= N) && m <= j) && 0 <= j) && N <= 2147483647) && 0 <= i) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((((((((n <= 2147483647 && m <= 2147483647) && 0 <= N) && j <= 0) && N <= i) && N <= k + 1) && 0 <= j) && i <= 2147483646) || (((((((((n <= 2147483647 && m <= 2147483647) && 0 <= k) && 0 <= N) && N <= i + 1) && N <= k + 1) && 0 <= j) && k <= 2147483646) && i <= 2147483646) && 0 <= i)) || (((((((i <= 0 && m <= 2147483647) && j <= 0) && 0 <= N) && 0 <= j) && n + i <= j + 2147483647) && N <= 2147483647) && 0 <= i)) || (((((((n <= 2147483647 && m <= 0) && 0 <= N) && j <= 0) && 0 <= j) && i <= 2147483646) && N <= 2147483647) && 0 <= i) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((((i <= 0 && n <= 2147483647) && m <= 2147483647) && 0 <= k) && 0 <= N) && 0 <= j) && k <= 2147483646) && N <= 2147483647) && 0 <= i) || (((((((((n <= 2147483647 && m <= 2147483647) && 0 <= k) && 0 <= N) && N <= i + 1) && N <= k + 1) && 0 <= j) && k <= 2147483646) && N <= 2147483647) && 0 <= i) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 8 error locations. Result: SAFE, OverallTime: 18.1s, OverallIterations: 18, TraceHistogramMax: 5, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, HoareTripleCheckerStatistics: 267 SDtfs, 1404 SDslu, 529 SDs, 0 SdLazy, 1030 SolverSat, 335 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 795 GetRequests, 475 SyntacticMatches, 56 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2618 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 1306 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 69 NumberOfFragments, 263 HoareAnnotationTreeSize, 4 FomulaSimplifications, 2556546 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 4 FomulaSimplificationsInter, 512725 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 518 NumberOfCodeBlocks, 436 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 705 ConstructedInterpolants, 0 QuantifiedInterpolants, 60017 SizeOfPredicates, 23 NumberOfNonLiveVariables, 488 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 36 InterpolantComputations, 11 PerfectInterpolantSequences, 369/716 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...