./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/Benghazi_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/Benghazi_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/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 2b89ce5b96ce55081609675201b2a9a116c2941a .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 05:33:15,671 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 05:33:15,672 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 05:33:15,678 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 05:33:15,678 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 05:33:15,679 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 05:33:15,679 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 05:33:15,680 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 05:33:15,681 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 05:33:15,681 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 05:33:15,682 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 05:33:15,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 05:33:15,682 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 05:33:15,683 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 05:33:15,683 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 05:33:15,684 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 05:33:15,684 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 05:33:15,685 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 05:33:15,686 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 05:33:15,686 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 05:33:15,687 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 05:33:15,688 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 05:33:15,689 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 05:33:15,689 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 05:33:15,689 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 05:33:15,689 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 05:33:15,690 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 05:33:15,690 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 05:33:15,691 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 05:33:15,691 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 05:33:15,691 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 05:33:15,692 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 05:33:15,692 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 05:33:15,692 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 05:33:15,692 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 05:33:15,693 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 05:33:15,693 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-12-03 05:33:15,700 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 05:33:15,700 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 05:33:15,700 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 05:33:15,701 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 05:33:15,701 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 05:33:15,701 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 05:33:15,701 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 05:33:15,701 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 05:33:15,701 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 05:33:15,701 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 05:33:15,701 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 05:33:15,702 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 05:33:15,702 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 05:33:15,702 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 05:33:15,702 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 05:33:15,702 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 05:33:15,703 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 05:33:15,703 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 05:33:15,703 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 05:33:15,703 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 05:33:15,703 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-03 05:33:15,703 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 05:33:15,703 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 05:33:15,703 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 05:33:15,704 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 05:33:15,704 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 05:33:15,704 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 05:33:15,704 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 05:33:15,704 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 05:33:15,704 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 05:33:15,704 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 05:33:15,704 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 05:33:15,705 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 05:33:15,705 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 05:33:15,705 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 05:33:15,705 INFO L133 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/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/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 -> 2b89ce5b96ce55081609675201b2a9a116c2941a [2018-12-03 05:33:15,722 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 05:33:15,729 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 05:33:15,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 05:33:15,731 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 05:33:15,732 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 05:33:15,732 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted/Benghazi_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-03 05:33:15,767 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/data/0d534446d/127dc3f80379408184a4161836c77fd5/FLAG91c276a52 [2018-12-03 05:33:16,171 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 05:33:16,172 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/sv-benchmarks/c/termination-crafted/Benghazi_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-03 05:33:16,175 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/data/0d534446d/127dc3f80379408184a4161836c77fd5/FLAG91c276a52 [2018-12-03 05:33:16,183 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/data/0d534446d/127dc3f80379408184a4161836c77fd5 [2018-12-03 05:33:16,185 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 05:33:16,186 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 05:33:16,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 05:33:16,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 05:33:16,188 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 05:33:16,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:33:16" (1/1) ... [2018-12-03 05:33:16,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cecaa61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:33:16, skipping insertion in model container [2018-12-03 05:33:16,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:33:16" (1/1) ... [2018-12-03 05:33:16,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 05:33:16,204 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 05:33:16,284 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:33:16,286 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 05:33:16,295 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:33:16,302 INFO L195 MainTranslator]: Completed translation [2018-12-03 05:33:16,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:33:16 WrapperNode [2018-12-03 05:33:16,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 05:33:16,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 05:33:16,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 05:33:16,303 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 05:33:16,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:33:16" (1/1) ... [2018-12-03 05:33:16,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:33:16" (1/1) ... [2018-12-03 05:33:16,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 05:33:16,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 05:33:16,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 05:33:16,314 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 05:33:16,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:33:16" (1/1) ... [2018-12-03 05:33:16,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:33:16" (1/1) ... [2018-12-03 05:33:16,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:33:16" (1/1) ... [2018-12-03 05:33:16,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:33:16" (1/1) ... [2018-12-03 05:33:16,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:33:16" (1/1) ... [2018-12-03 05:33:16,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:33:16" (1/1) ... [2018-12-03 05:33:16,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:33:16" (1/1) ... [2018-12-03 05:33:16,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 05:33:16,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 05:33:16,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 05:33:16,325 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 05:33:16,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:33:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/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 [2018-12-03 05:33:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 05:33:16,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 05:33:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 05:33:16,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 05:33:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 05:33:16,383 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 05:33:16,462 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 05:33:16,462 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 05:33:16,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:33:16 BoogieIcfgContainer [2018-12-03 05:33:16,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 05:33:16,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 05:33:16,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 05:33:16,464 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 05:33:16,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 05:33:16" (1/3) ... [2018-12-03 05:33:16,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1564d0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:33:16, skipping insertion in model container [2018-12-03 05:33:16,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:33:16" (2/3) ... [2018-12-03 05:33:16,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1564d0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:33:16, skipping insertion in model container [2018-12-03 05:33:16,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:33:16" (3/3) ... [2018-12-03 05:33:16,466 INFO L112 eAbstractionObserver]: Analyzing ICFG Benghazi_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-03 05:33:16,472 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 05:33:16,476 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-12-03 05:33:16,485 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-12-03 05:33:16,503 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 05:33:16,503 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 05:33:16,503 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 05:33:16,503 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 05:33:16,503 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 05:33:16,503 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 05:33:16,503 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 05:33:16,503 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 05:33:16,513 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-12-03 05:33:16,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 05:33:16,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:16,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:16,518 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:16,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:16,522 INFO L82 PathProgramCache]: Analyzing trace with hash -778806590, now seen corresponding path program 1 times [2018-12-03 05:33:16,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:16,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:16,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:16,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:16,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:16,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:33:16,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 05:33:16,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:33:16,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:33:16,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:33:16,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:33:16,615 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-12-03 05:33:16,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:16,641 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-12-03 05:33:16,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:33:16,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-03 05:33:16,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:16,648 INFO L225 Difference]: With dead ends: 35 [2018-12-03 05:33:16,648 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 05:33:16,650 INFO L631 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 [2018-12-03 05:33:16,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 05:33:16,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-12-03 05:33:16,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 05:33:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 05:33:16,670 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 7 [2018-12-03 05:33:16,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:16,670 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 05:33:16,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:33:16,671 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 05:33:16,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 05:33:16,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:16,671 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:16,671 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:16,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:16,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1626799533, now seen corresponding path program 1 times [2018-12-03 05:33:16,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:16,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:16,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:16,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:16,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:16,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:33:16,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:33:16,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:33:16,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:33:16,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:33:16,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:33:16,694 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 4 states. [2018-12-03 05:33:16,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:16,717 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 05:33:16,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:33:16,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-03 05:33:16,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:16,718 INFO L225 Difference]: With dead ends: 26 [2018-12-03 05:33:16,718 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 05:33:16,719 INFO L631 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 [2018-12-03 05:33:16,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 05:33:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-12-03 05:33:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 05:33:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 05:33:16,721 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 8 [2018-12-03 05:33:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:16,721 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 05:33:16,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:33:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 05:33:16,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 05:33:16,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:16,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:16,722 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:16,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:16,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1108821980, now seen corresponding path program 1 times [2018-12-03 05:33:16,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:16,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:16,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:16,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:16,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:16,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:16,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:33:16,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 05:33:16,734 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:33:16,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:33:16,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:33:16,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:33:16,735 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 3 states. [2018-12-03 05:33:16,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:16,744 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-12-03 05:33:16,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:33:16,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-03 05:33:16,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:16,745 INFO L225 Difference]: With dead ends: 28 [2018-12-03 05:33:16,745 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 05:33:16,745 INFO L631 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 [2018-12-03 05:33:16,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 05:33:16,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-12-03 05:33:16,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 05:33:16,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 05:33:16,747 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 9 [2018-12-03 05:33:16,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:16,748 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 05:33:16,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:33:16,748 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 05:33:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 05:33:16,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:16,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:16,748 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:16,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:16,748 INFO L82 PathProgramCache]: Analyzing trace with hash -13742961, now seen corresponding path program 1 times [2018-12-03 05:33:16,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:16,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:16,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:16,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:16,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:16,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:33:16,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 05:33:16,767 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:33:16,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:33:16,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:33:16,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:33:16,767 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 3 states. [2018-12-03 05:33:16,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:16,776 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 05:33:16,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:33:16,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 05:33:16,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:16,776 INFO L225 Difference]: With dead ends: 28 [2018-12-03 05:33:16,776 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 05:33:16,777 INFO L631 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 [2018-12-03 05:33:16,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 05:33:16,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-12-03 05:33:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 05:33:16,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 05:33:16,779 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 10 [2018-12-03 05:33:16,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:16,779 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 05:33:16,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:33:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 05:33:16,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 05:33:16,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:16,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:16,780 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:16,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:16,780 INFO L82 PathProgramCache]: Analyzing trace with hash -426031738, now seen corresponding path program 1 times [2018-12-03 05:33:16,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:16,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:16,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:16,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:16,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:16,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:16,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:33:16,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:33:16,799 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:33:16,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:33:16,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:33:16,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:33:16,799 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 4 states. [2018-12-03 05:33:16,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:16,826 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-12-03 05:33:16,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:33:16,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-03 05:33:16,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:16,827 INFO L225 Difference]: With dead ends: 31 [2018-12-03 05:33:16,827 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 05:33:16,827 INFO L631 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 [2018-12-03 05:33:16,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 05:33:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-03 05:33:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 05:33:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 05:33:16,830 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 11 [2018-12-03 05:33:16,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:16,830 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 05:33:16,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:33:16,830 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 05:33:16,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 05:33:16,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:16,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:16,830 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:16,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:16,831 INFO L82 PathProgramCache]: Analyzing trace with hash -322081935, now seen corresponding path program 1 times [2018-12-03 05:33:16,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:16,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:16,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:16,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:16,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:16,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:33:16,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:33:16,850 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:33:16,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:33:16,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:33:16,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:33:16,851 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 4 states. [2018-12-03 05:33:16,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:16,874 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 05:33:16,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:33:16,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-03 05:33:16,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:16,875 INFO L225 Difference]: With dead ends: 31 [2018-12-03 05:33:16,876 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 05:33:16,876 INFO L631 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 [2018-12-03 05:33:16,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 05:33:16,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2018-12-03 05:33:16,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 05:33:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 05:33:16,879 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 12 [2018-12-03 05:33:16,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:16,879 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 05:33:16,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:33:16,880 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 05:33:16,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 05:33:16,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:16,880 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:16,880 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:16,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:16,881 INFO L82 PathProgramCache]: Analyzing trace with hash -283092845, now seen corresponding path program 1 times [2018-12-03 05:33:16,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:16,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:16,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:16,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:16,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:16,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:16,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:16,908 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:33:16,909 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-03 05:33:16,910 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [14], [15], [17], [19], [21], [23], [25], [31], [32], [33] [2018-12-03 05:33:16,930 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 05:33:16,931 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 05:33:17,049 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 05:33:17,050 INFO L272 AbstractInterpreter]: Visited 13 different actions 49 times. Merged at 8 different actions 36 times. Widened at 1 different actions 1 times. Performed 226 root evaluator evaluations with a maximum evaluation depth of 3. Performed 226 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-12-03 05:33:17,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:17,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 05:33:17,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:17,057 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 05:33:17,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:17,064 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 05:33:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:17,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:33:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:17,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:33:17,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:17,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 05:33:17,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2018-12-03 05:33:17,196 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 05:33:17,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 05:33:17,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 05:33:17,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-12-03 05:33:17,197 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 9 states. [2018-12-03 05:33:17,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:17,246 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 05:33:17,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 05:33:17,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-12-03 05:33:17,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:17,246 INFO L225 Difference]: With dead ends: 34 [2018-12-03 05:33:17,247 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 05:33:17,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-12-03 05:33:17,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 05:33:17,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-12-03 05:33:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 05:33:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 05:33:17,250 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2018-12-03 05:33:17,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:17,250 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 05:33:17,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 05:33:17,250 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 05:33:17,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 05:33:17,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:17,251 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:17,251 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:17,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:17,251 INFO L82 PathProgramCache]: Analyzing trace with hash -185943556, now seen corresponding path program 1 times [2018-12-03 05:33:17,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:17,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:17,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:17,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:17,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:17,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:17,273 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:33:17,273 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 05:33:17,273 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [15], [16], [17], [19], [21], [23], [25], [31], [32], [33] [2018-12-03 05:33:17,274 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 05:33:17,274 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 05:33:17,312 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 05:33:17,313 INFO L272 AbstractInterpreter]: Visited 13 different actions 49 times. Merged at 8 different actions 36 times. Widened at 1 different actions 1 times. Performed 226 root evaluator evaluations with a maximum evaluation depth of 3. Performed 226 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-12-03 05:33:17,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:17,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 05:33:17,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:17,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 05:33:17,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:17,321 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 05:33:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:17,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:33:17,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:17,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:33:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:17,376 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 05:33:17,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 10 [2018-12-03 05:33:17,376 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:33:17,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:33:17,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:33:17,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-03 05:33:17,377 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 5 states. [2018-12-03 05:33:17,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:17,403 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 05:33:17,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 05:33:17,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-12-03 05:33:17,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:17,404 INFO L225 Difference]: With dead ends: 27 [2018-12-03 05:33:17,404 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 05:33:17,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-03 05:33:17,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 05:33:17,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 05:33:17,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 05:33:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 05:33:17,406 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 15 [2018-12-03 05:33:17,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:17,407 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 05:33:17,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:33:17,407 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 05:33:17,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 05:33:17,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:17,407 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:17,407 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:17,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:17,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1469282891, now seen corresponding path program 1 times [2018-12-03 05:33:17,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:17,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:17,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:17,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:17,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:17,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:17,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:33:17,430 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 05:33:17,430 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [15], [17], [18], [19], [21], [23], [25], [31], [32], [33] [2018-12-03 05:33:17,431 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 05:33:17,431 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 05:33:17,461 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 05:33:17,461 INFO L272 AbstractInterpreter]: Visited 13 different actions 53 times. Merged at 8 different actions 38 times. Widened at 1 different actions 1 times. Performed 224 root evaluator evaluations with a maximum evaluation depth of 3. Performed 224 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-12-03 05:33:17,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:17,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 05:33:17,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:17,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 05:33:17,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:17,469 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 05:33:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:17,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:33:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:17,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:33:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:17,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 05:33:17,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 05:33:17,517 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 05:33:17,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:33:17,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:33:17,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:33:17,518 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 5 states. [2018-12-03 05:33:17,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:17,555 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-12-03 05:33:17,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 05:33:17,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-03 05:33:17,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:17,556 INFO L225 Difference]: With dead ends: 34 [2018-12-03 05:33:17,557 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 05:33:17,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-03 05:33:17,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 05:33:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2018-12-03 05:33:17,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 05:33:17,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 05:33:17,560 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 16 [2018-12-03 05:33:17,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:17,560 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 05:33:17,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:33:17,561 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 05:33:17,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 05:33:17,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:17,561 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:17,561 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:17,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:17,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1696870686, now seen corresponding path program 1 times [2018-12-03 05:33:17,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:17,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:17,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:17,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:17,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:17,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:17,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:33:17,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 05:33:17,578 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:33:17,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:33:17,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:33:17,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:33:17,579 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 3 states. [2018-12-03 05:33:17,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:17,584 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 05:33:17,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:33:17,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 05:33:17,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:17,585 INFO L225 Difference]: With dead ends: 28 [2018-12-03 05:33:17,585 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 05:33:17,585 INFO L631 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 [2018-12-03 05:33:17,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 05:33:17,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 05:33:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 05:33:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 05:33:17,588 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 17 [2018-12-03 05:33:17,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:17,589 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 05:33:17,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:33:17,589 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 05:33:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 05:33:17,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:17,589 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:17,590 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:17,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:17,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1063383767, now seen corresponding path program 1 times [2018-12-03 05:33:17,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:17,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:17,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:17,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:17,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:17,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:17,615 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:33:17,615 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 05:33:17,615 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [15], [17], [19], [21], [22], [23], [25], [31], [32], [33] [2018-12-03 05:33:17,616 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 05:33:17,616 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 05:33:17,650 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 05:33:17,651 INFO L272 AbstractInterpreter]: Visited 13 different actions 53 times. Merged at 8 different actions 36 times. Widened at 1 different actions 1 times. Performed 231 root evaluator evaluations with a maximum evaluation depth of 3. Performed 231 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 5 variables. [2018-12-03 05:33:17,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:17,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 05:33:17,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:17,658 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 05:33:17,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:17,664 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 05:33:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:17,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:33:17,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:17,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:33:17,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:17,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 05:33:17,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 05:33:17,706 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 05:33:17,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:33:17,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:33:17,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:33:17,706 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 5 states. [2018-12-03 05:33:17,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:17,747 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-12-03 05:33:17,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 05:33:17,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-03 05:33:17,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:17,748 INFO L225 Difference]: With dead ends: 35 [2018-12-03 05:33:17,748 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 05:33:17,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-03 05:33:17,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 05:33:17,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2018-12-03 05:33:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 05:33:17,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 05:33:17,750 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 18 [2018-12-03 05:33:17,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:17,750 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 05:33:17,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:33:17,751 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 05:33:17,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 05:33:17,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:17,751 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:17,751 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:17,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:17,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1394841536, now seen corresponding path program 1 times [2018-12-03 05:33:17,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:17,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:17,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:17,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:17,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:17,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:17,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:33:17,774 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-03 05:33:17,775 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [15], [17], [19], [21], [23], [24], [25], [31], [32], [33] [2018-12-03 05:33:17,775 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 05:33:17,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 05:33:17,805 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 05:33:17,805 INFO L272 AbstractInterpreter]: Visited 13 different actions 53 times. Merged at 8 different actions 36 times. Widened at 1 different actions 1 times. Performed 231 root evaluator evaluations with a maximum evaluation depth of 3. Performed 231 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 5 variables. [2018-12-03 05:33:17,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:17,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 05:33:17,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:17,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 05:33:17,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:17,813 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 05:33:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:17,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:33:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:17,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:33:17,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:17,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 05:33:17,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2018-12-03 05:33:17,862 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 05:33:17,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:33:17,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:33:17,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-03 05:33:17,862 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 7 states. [2018-12-03 05:33:17,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:17,932 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-03 05:33:17,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 05:33:17,933 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-12-03 05:33:17,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:17,933 INFO L225 Difference]: With dead ends: 39 [2018-12-03 05:33:17,933 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 05:33:17,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2018-12-03 05:33:17,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 05:33:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-12-03 05:33:17,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 05:33:17,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 05:33:17,935 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 19 [2018-12-03 05:33:17,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:17,935 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 05:33:17,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:33:17,935 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 05:33:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 05:33:17,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:17,936 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:17,936 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:17,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:17,936 INFO L82 PathProgramCache]: Analyzing trace with hash -412918366, now seen corresponding path program 2 times [2018-12-03 05:33:17,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:17,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:17,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:17,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:17,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:17,979 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:17,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:17,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:33:17,979 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 05:33:17,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 05:33:17,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:17,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 05:33:17,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 05:33:17,986 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 05:33:17,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 05:33:17,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:33:17,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:33:18,063 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:18,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:33:18,120 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:18,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 05:33:18,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2018-12-03 05:33:18,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 05:33:18,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 05:33:18,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 05:33:18,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-12-03 05:33:18,145 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 15 states. [2018-12-03 05:33:18,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:18,217 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 05:33:18,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 05:33:18,218 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-12-03 05:33:18,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:18,218 INFO L225 Difference]: With dead ends: 28 [2018-12-03 05:33:18,218 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 05:33:18,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2018-12-03 05:33:18,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 05:33:18,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 05:33:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 05:33:18,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 05:33:18,221 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2018-12-03 05:33:18,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:18,221 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 05:33:18,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 05:33:18,221 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 05:33:18,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 05:33:18,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:18,222 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:18,222 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:18,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:18,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1677556988, now seen corresponding path program 2 times [2018-12-03 05:33:18,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:18,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:18,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:33:18,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:18,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:18,243 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:18,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:18,243 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:33:18,243 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 05:33:18,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 05:33:18,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:18,243 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 05:33:18,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 05:33:18,251 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 05:33:18,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 05:33:18,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:33:18,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:33:18,286 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:18,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:33:18,341 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:18,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 05:33:18,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2018-12-03 05:33:18,355 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 05:33:18,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 05:33:18,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 05:33:18,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-12-03 05:33:18,356 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2018-12-03 05:33:18,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:18,451 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 05:33:18,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 05:33:18,451 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-12-03 05:33:18,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:18,452 INFO L225 Difference]: With dead ends: 37 [2018-12-03 05:33:18,452 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 05:33:18,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-12-03 05:33:18,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 05:33:18,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-12-03 05:33:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 05:33:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 05:33:18,454 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 23 [2018-12-03 05:33:18,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:18,454 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 05:33:18,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 05:33:18,455 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 05:33:18,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 05:33:18,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:18,455 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:18,455 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:18,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:18,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1519527834, now seen corresponding path program 2 times [2018-12-03 05:33:18,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:18,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:18,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:33:18,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:18,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:18,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:18,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:33:18,499 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 05:33:18,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 05:33:18,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:18,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 05:33:18,506 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 05:33:18,506 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 05:33:18,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 05:33:18,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:33:18,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:33:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:18,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:33:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:18,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 05:33:18,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 05:33:18,554 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 05:33:18,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:33:18,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:33:18,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-03 05:33:18,554 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 7 states. [2018-12-03 05:33:18,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:18,600 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 05:33:18,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 05:33:18,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-12-03 05:33:18,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:18,600 INFO L225 Difference]: With dead ends: 39 [2018-12-03 05:33:18,600 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 05:33:18,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-12-03 05:33:18,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 05:33:18,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-12-03 05:33:18,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 05:33:18,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 05:33:18,603 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 25 [2018-12-03 05:33:18,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:18,604 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 05:33:18,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:33:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 05:33:18,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 05:33:18,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:18,604 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:18,605 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:18,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:18,605 INFO L82 PathProgramCache]: Analyzing trace with hash -22888747, now seen corresponding path program 3 times [2018-12-03 05:33:18,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:18,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:18,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:33:18,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:18,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:18,636 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:18,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:18,636 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:33:18,636 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 05:33:18,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 05:33:18,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:18,636 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 05:33:18,643 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 05:33:18,643 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 05:33:18,649 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 05:33:18,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:33:18,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:33:18,652 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:18,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:33:18,688 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:18,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 05:33:18,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 05:33:18,702 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 05:33:18,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 05:33:18,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 05:33:18,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-03 05:33:18,703 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 8 states. [2018-12-03 05:33:18,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:18,754 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 05:33:18,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 05:33:18,754 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-12-03 05:33:18,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:18,755 INFO L225 Difference]: With dead ends: 44 [2018-12-03 05:33:18,755 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 05:33:18,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2018-12-03 05:33:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 05:33:18,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-12-03 05:33:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 05:33:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 05:33:18,758 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 30 [2018-12-03 05:33:18,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:18,758 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 05:33:18,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 05:33:18,758 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 05:33:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 05:33:18,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:18,759 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:18,759 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:18,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:18,759 INFO L82 PathProgramCache]: Analyzing trace with hash -521247753, now seen corresponding path program 3 times [2018-12-03 05:33:18,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:18,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:18,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:33:18,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:18,761 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:18,791 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:18,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:18,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:33:18,791 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 05:33:18,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 05:33:18,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:18,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 05:33:18,803 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 05:33:18,803 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 05:33:18,809 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 05:33:18,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:33:18,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:33:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:18,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:33:18,859 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:18,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 05:33:18,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 05:33:18,874 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 05:33:18,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 05:33:18,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 05:33:18,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-03 05:33:18,874 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 8 states. [2018-12-03 05:33:18,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:18,932 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 05:33:18,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 05:33:18,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-12-03 05:33:18,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:18,932 INFO L225 Difference]: With dead ends: 46 [2018-12-03 05:33:18,932 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 05:33:18,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2018-12-03 05:33:18,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 05:33:18,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-12-03 05:33:18,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 05:33:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 05:33:18,935 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 32 [2018-12-03 05:33:18,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:18,935 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 05:33:18,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 05:33:18,935 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 05:33:18,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 05:33:18,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:18,936 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:18,936 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:18,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:18,936 INFO L82 PathProgramCache]: Analyzing trace with hash 472892900, now seen corresponding path program 4 times [2018-12-03 05:33:18,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:18,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:18,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:33:18,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:18,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:18,964 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:18,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:18,965 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:33:18,965 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 05:33:18,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 05:33:18,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:18,965 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 05:33:18,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:18,975 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 05:33:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:18,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:33:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:18,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:33:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:19,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 05:33:19,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 05:33:19,040 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 05:33:19,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 05:33:19,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 05:33:19,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-12-03 05:33:19,041 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 9 states. [2018-12-03 05:33:19,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:19,123 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 05:33:19,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 05:33:19,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-12-03 05:33:19,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:19,124 INFO L225 Difference]: With dead ends: 51 [2018-12-03 05:33:19,124 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 05:33:19,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 05:33:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 05:33:19,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-12-03 05:33:19,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 05:33:19,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 05:33:19,127 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 37 [2018-12-03 05:33:19,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:19,127 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 05:33:19,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 05:33:19,127 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 05:33:19,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 05:33:19,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:19,127 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:19,128 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:19,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:19,128 INFO L82 PathProgramCache]: Analyzing trace with hash -816454842, now seen corresponding path program 4 times [2018-12-03 05:33:19,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:19,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:19,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:19,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:19,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:19,171 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:19,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:19,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:33:19,171 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 05:33:19,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 05:33:19,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:19,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 05:33:19,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:19,179 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 05:33:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:19,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:33:19,190 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:19,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:33:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:19,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 05:33:19,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 05:33:19,275 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 05:33:19,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 05:33:19,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 05:33:19,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-12-03 05:33:19,276 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 10 states. [2018-12-03 05:33:19,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:19,376 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 05:33:19,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 05:33:19,376 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-12-03 05:33:19,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:19,376 INFO L225 Difference]: With dead ends: 53 [2018-12-03 05:33:19,376 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 05:33:19,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=206, Invalid=444, Unknown=0, NotChecked=0, Total=650 [2018-12-03 05:33:19,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 05:33:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-12-03 05:33:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 05:33:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 05:33:19,379 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 39 [2018-12-03 05:33:19,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:19,379 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 05:33:19,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 05:33:19,379 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 05:33:19,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 05:33:19,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:19,379 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:19,380 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:19,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:19,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1416527861, now seen corresponding path program 5 times [2018-12-03 05:33:19,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:19,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:19,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:19,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:19,381 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:19,424 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:19,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:19,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:33:19,424 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 05:33:19,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 05:33:19,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:19,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 05:33:19,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 05:33:19,430 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 05:33:19,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 05:33:19,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:33:19,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:33:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:19,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:33:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:19,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 05:33:19,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 05:33:19,533 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 05:33:19,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 05:33:19,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 05:33:19,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-12-03 05:33:19,533 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 11 states. [2018-12-03 05:33:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:19,610 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-03 05:33:19,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 05:33:19,610 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-12-03 05:33:19,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:19,610 INFO L225 Difference]: With dead ends: 58 [2018-12-03 05:33:19,610 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 05:33:19,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=254, Invalid=558, Unknown=0, NotChecked=0, Total=812 [2018-12-03 05:33:19,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 05:33:19,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-12-03 05:33:19,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 05:33:19,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 05:33:19,613 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 44 [2018-12-03 05:33:19,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:19,614 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 05:33:19,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 05:33:19,614 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 05:33:19,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 05:33:19,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:19,614 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:19,614 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:19,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:19,614 INFO L82 PathProgramCache]: Analyzing trace with hash -221356777, now seen corresponding path program 5 times [2018-12-03 05:33:19,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:19,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:19,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:33:19,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:19,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:19,666 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:19,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:19,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:33:19,666 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 05:33:19,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 05:33:19,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:19,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 05:33:19,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 05:33:19,674 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 05:33:19,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 05:33:19,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:33:19,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:33:19,805 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 19 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:19,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:33:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 2 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:20,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 05:33:20,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 15] total 38 [2018-12-03 05:33:20,006 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 05:33:20,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 05:33:20,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 05:33:20,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1331, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 05:33:20,007 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 25 states. [2018-12-03 05:33:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:20,555 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-12-03 05:33:20,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 05:33:20,556 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-12-03 05:33:20,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:20,556 INFO L225 Difference]: With dead ends: 59 [2018-12-03 05:33:20,556 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 05:33:20,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=941, Invalid=2965, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 05:33:20,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 05:33:20,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2018-12-03 05:33:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 05:33:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 05:33:20,559 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 46 [2018-12-03 05:33:20,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:20,559 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 05:33:20,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 05:33:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 05:33:20,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 05:33:20,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:20,560 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:20,560 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:20,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:20,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2063499460, now seen corresponding path program 6 times [2018-12-03 05:33:20,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:20,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:20,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:33:20,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:20,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:20,605 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:20,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:20,605 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:33:20,605 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 05:33:20,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 05:33:20,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:20,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 05:33:20,613 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 05:33:20,613 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 05:33:20,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 05:33:20,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:33:20,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:33:20,626 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:20,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:33:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:20,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 05:33:20,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 05:33:20,714 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 05:33:20,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 05:33:20,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 05:33:20,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-12-03 05:33:20,715 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 12 states. [2018-12-03 05:33:20,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:20,809 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-03 05:33:20,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 05:33:20,809 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-12-03 05:33:20,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:20,810 INFO L225 Difference]: With dead ends: 63 [2018-12-03 05:33:20,810 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 05:33:20,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=311, Invalid=681, Unknown=0, NotChecked=0, Total=992 [2018-12-03 05:33:20,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 05:33:20,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2018-12-03 05:33:20,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 05:33:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-03 05:33:20,814 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 51 [2018-12-03 05:33:20,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:20,814 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-03 05:33:20,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 05:33:20,814 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-03 05:33:20,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 05:33:20,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:20,815 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:20,815 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:20,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:20,815 INFO L82 PathProgramCache]: Analyzing trace with hash -780023531, now seen corresponding path program 7 times [2018-12-03 05:33:20,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:20,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:20,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:33:20,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:20,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:20,891 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:20,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:20,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:33:20,892 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 05:33:20,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 05:33:20,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:20,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 05:33:20,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:20,898 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 05:33:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:20,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:33:20,913 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:20,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:33:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:21,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 05:33:21,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 05:33:21,022 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 05:33:21,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 05:33:21,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 05:33:21,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2018-12-03 05:33:21,022 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 14 states. [2018-12-03 05:33:21,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:21,141 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-03 05:33:21,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 05:33:21,141 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-12-03 05:33:21,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:21,141 INFO L225 Difference]: With dead ends: 70 [2018-12-03 05:33:21,142 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 05:33:21,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=434, Invalid=972, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 05:33:21,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 05:33:21,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-12-03 05:33:21,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 05:33:21,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 05:33:21,145 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 58 [2018-12-03 05:33:21,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:21,145 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 05:33:21,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 05:33:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 05:33:21,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 05:33:21,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:33:21,145 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-12-03 05:33:21,146 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 05:33:21,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:33:21,146 INFO L82 PathProgramCache]: Analyzing trace with hash -461589596, now seen corresponding path program 8 times [2018-12-03 05:33:21,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:33:21,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:21,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:33:21,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:33:21,147 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:33:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:33:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:33:21,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:21,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:33:21,209 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 05:33:21,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 05:33:21,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:33:21,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 05:33:21,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 05:33:21,215 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 05:33:21,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 05:33:21,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:33:21,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:33:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 96 proven. 123 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 05:33:25,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:33:27,131 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 96 proven. 123 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 05:33:27,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 05:33:27,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 19] total 51 [2018-12-03 05:33:27,156 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 05:33:27,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 05:33:27,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 05:33:27,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2435, Unknown=7, NotChecked=0, Total=2652 [2018-12-03 05:33:27,157 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 34 states. [2018-12-03 05:33:30,824 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2018-12-03 05:33:35,674 WARN L180 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2018-12-03 05:33:36,852 WARN L180 SmtUtils]: Spent 916.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2018-12-03 05:33:38,984 WARN L180 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2018-12-03 05:33:49,353 WARN L180 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2018-12-03 05:33:51,018 WARN L180 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2018-12-03 05:33:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:33:54,219 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-12-03 05:33:54,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 05:33:54,220 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2018-12-03 05:33:54,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:33:54,220 INFO L225 Difference]: With dead ends: 76 [2018-12-03 05:33:54,220 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 05:33:54,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 1967 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=2141, Invalid=7944, Unknown=15, NotChecked=0, Total=10100 [2018-12-03 05:33:54,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 05:33:54,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 05:33:54,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 05:33:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 05:33:54,223 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2018-12-03 05:33:54,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:33:54,223 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 05:33:54,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 05:33:54,223 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 05:33:54,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 05:33:54,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 05:33:58,669 WARN L180 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 136 DAG size of output: 61 [2018-12-03 05:33:58,670 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-03 05:33:58,670 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 05:33:58,670 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 05:33:58,671 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-03 05:33:58,671 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 05:33:58,671 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 05:33:58,671 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-12-03 05:33:58,671 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 16 29) no Hoare annotation was computed. [2018-12-03 05:33:58,671 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-12-03 05:33:58,671 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-12-03 05:33:58,671 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-12-03 05:33:58,671 INFO L448 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-12-03 05:33:58,671 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 16 29) no Hoare annotation was computed. [2018-12-03 05:33:58,671 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2018-12-03 05:33:58,671 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2018-12-03 05:33:58,671 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 16 29) the Hoare annotation is: true [2018-12-03 05:33:58,671 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-12-03 05:33:58,671 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-12-03 05:33:58,671 INFO L444 ceAbstractionStarter]: At program point L22-2(lines 22 27) the Hoare annotation is: (let ((.cse8 (<= main_~x~0 2147483499)) (.cse14 (+ main_~d2~0 main_~x~0)) (.cse13 (+ main_~d1old~0 main_~x~0))) (let ((.cse3 (<= main_~d1~0 75)) (.cse5 (<= 75 main_~d1~0)) (.cse6 (<= main_~d1old~0 75)) (.cse7 (<= main_~d2~0 76)) (.cse0 (<= .cse13 2147483647)) (.cse4 (<= 1 .cse14)) (.cse11 (and .cse8 (<= main_~d1~0 2147483647))) (.cse9 (<= 76 main_~d2~0)) (.cse12 (<= 77 main_~d1~0)) (.cse10 (<= 75 main_~d1old~0)) (.cse2 (<= main_~d2~0 74)) (.cse1 (<= 74 main_~d2~0))) (or (and .cse0 .cse1 (<= main_~d1old~0 73) .cse2 .cse3 (<= 73 main_~d1old~0) .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse3 .cse4 .cse9 .cse5 .cse10) (and .cse6 .cse7 (<= main_~d1~0 77) .cse11 .cse4 .cse9 .cse12 .cse10) (and (<= 0 .cse13) .cse0 (exists ((v_main_~x~0_97 Int)) (and (<= (+ main_~d2~0 main_~x~0) (+ v_main_~x~0_97 1)) (<= (+ main_~d2~0 (* 2 v_main_~x~0_97)) 6442450936))) .cse4 (and .cse11 (<= .cse14 2147483648) .cse9 (<= (+ main_~x~0 main_~d1~0) 2147483572) (<= main_~d1old~0 2147483572) .cse12 .cse10)) (and (<= main_~d1~0 73) .cse2 (<= main_~x~0 (+ main_~d1~0 2147483574)) .cse1 (<= 73 main_~d1~0))))) [2018-12-03 05:33:58,671 INFO L448 ceAbstractionStarter]: For program point L22-3(lines 22 27) no Hoare annotation was computed. [2018-12-03 05:33:58,671 INFO L448 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-12-03 05:33:58,671 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2018-12-03 05:33:58,672 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2018-12-03 05:33:58,675 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_97,QUANTIFIED] [2018-12-03 05:33:58,675 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_97,QUANTIFIED] [2018-12-03 05:33:58,680 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_97,QUANTIFIED] [2018-12-03 05:33:58,680 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_97,QUANTIFIED] [2018-12-03 05:33:58,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:33:58 BoogieIcfgContainer [2018-12-03 05:33:58,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 05:33:58,683 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 05:33:58,683 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 05:33:58,683 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 05:33:58,683 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:33:16" (3/4) ... [2018-12-03 05:33:58,685 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 05:33:58,689 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 05:33:58,689 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 05:33:58,691 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-03 05:33:58,691 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-03 05:33:58,691 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-03 05:33:58,691 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-03 05:33:58,709 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((d1\old + x <= 2147483647 && 74 <= d2) && d1\old <= 73) && d2 <= 74) && d1 <= 75) && 73 <= d1\old) && 1 <= d2 + x) && 75 <= d1) || (((((((d1\old <= 75 && d2 <= 76) && x <= 2147483499) && d1 <= 75) && 1 <= d2 + x) && 76 <= d2) && 75 <= d1) && 75 <= d1\old)) || (((((((d1\old <= 75 && d2 <= 76) && d1 <= 77) && x <= 2147483499 && d1 <= 2147483647) && 1 <= d2 + x) && 76 <= d2) && 77 <= d1) && 75 <= d1\old)) || ((((0 <= d1\old + x && d1\old + x <= 2147483647) && (\exists v_main_~x~0_97 : int :: d2 + x <= v_main_~x~0_97 + 1 && d2 + 2 * v_main_~x~0_97 <= 6442450936)) && 1 <= d2 + x) && ((((((x <= 2147483499 && d1 <= 2147483647) && d2 + x <= 2147483648) && 76 <= d2) && x + d1 <= 2147483572) && d1\old <= 2147483572) && 77 <= d1) && 75 <= d1\old)) || ((((d1 <= 73 && d2 <= 74) && x <= d1 + 2147483574) && 74 <= d2) && 73 <= d1) [2018-12-03 05:33:58,717 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a172f47d-ef73-4546-bd98-b4288b4d0aa4/bin-2019/utaipan/witness.graphml [2018-12-03 05:33:58,717 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 05:33:58,718 INFO L168 Benchmark]: Toolchain (without parser) took 42532.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.6 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -151.7 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2018-12-03 05:33:58,718 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 05:33:58,718 INFO L168 Benchmark]: CACSL2BoogieTranslator took 116.73 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-03 05:33:58,719 INFO L168 Benchmark]: Boogie Procedure Inliner took 10.96 ms. Allocated memory is still 1.0 GB. Free memory is still 940.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 05:33:58,719 INFO L168 Benchmark]: Boogie Preprocessor took 10.83 ms. Allocated memory is still 1.0 GB. Free memory is still 940.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 05:33:58,719 INFO L168 Benchmark]: RCFGBuilder took 137.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 940.0 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-12-03 05:33:58,719 INFO L168 Benchmark]: TraceAbstraction took 42219.68 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 88.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.6 MB). Peak memory consumption was 385.0 MB. Max. memory is 11.5 GB. [2018-12-03 05:33:58,720 INFO L168 Benchmark]: Witness Printer took 34.65 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. [2018-12-03 05:33:58,721 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 116.73 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 10.96 ms. Allocated memory is still 1.0 GB. Free memory is still 940.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.83 ms. Allocated memory is still 1.0 GB. Free memory is still 940.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 137.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 940.0 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42219.68 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 88.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.6 MB). Peak memory consumption was 385.0 MB. Max. memory is 11.5 GB. * Witness Printer took 34.65 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. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_97,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_97,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_97,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_97,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: 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: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant [2018-12-03 05:33:58,723 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_97,QUANTIFIED] [2018-12-03 05:33:58,723 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_97,QUANTIFIED] [2018-12-03 05:33:58,724 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_97,QUANTIFIED] [2018-12-03 05:33:58,724 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_97,QUANTIFIED] Derived loop invariant: ((((((((((d1\old + x <= 2147483647 && 74 <= d2) && d1\old <= 73) && d2 <= 74) && d1 <= 75) && 73 <= d1\old) && 1 <= d2 + x) && 75 <= d1) || (((((((d1\old <= 75 && d2 <= 76) && x <= 2147483499) && d1 <= 75) && 1 <= d2 + x) && 76 <= d2) && 75 <= d1) && 75 <= d1\old)) || (((((((d1\old <= 75 && d2 <= 76) && d1 <= 77) && x <= 2147483499 && d1 <= 2147483647) && 1 <= d2 + x) && 76 <= d2) && 77 <= d1) && 75 <= d1\old)) || ((((0 <= d1\old + x && d1\old + x <= 2147483647) && (\exists v_main_~x~0_97 : int :: d2 + x <= v_main_~x~0_97 + 1 && d2 + 2 * v_main_~x~0_97 <= 6442450936)) && 1 <= d2 + x) && ((((((x <= 2147483499 && d1 <= 2147483647) && d2 + x <= 2147483648) && 76 <= d2) && x + d1 <= 2147483572) && d1\old <= 2147483572) && 77 <= d1) && 75 <= d1\old)) || ((((d1 <= 73 && d2 <= 74) && x <= d1 + 2147483574) && 74 <= d2) && 73 <= d1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 6 error locations. SAFE Result, 42.1s OverallTime, 24 OverallIterations, 9 TraceHistogramMax, 28.7s AutomataDifference, 0.0s DeadEndRemovalTime, 4.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 264 SDtfs, 861 SDslu, 830 SDs, 0 SdLazy, 1631 SolverSat, 512 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 13.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1410 GetRequests, 945 SyntacticMatches, 4 SemanticMatches, 461 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 3649 ImplicationChecksByTransitivity, 22.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 91 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 14 NumberOfFragments, 172 HoareAnnotationTreeSize, 5 FomulaSimplifications, 2568 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 4732 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 1180 NumberOfCodeBlocks, 1173 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 1675 ConstructedInterpolants, 34 QuantifiedInterpolants, 243938 SizeOfPredicates, 113 NumberOfNonLiveVariables, 1275 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 58 InterpolantComputations, 9 PerfectInterpolantSequences, 255/2960 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...