./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted/Toulouse-MultiBranchesToLoop_false-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-crafted/Toulouse-MultiBranchesToLoop_false-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4f493a0ec5685991b86ced08697f863f174636a1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 21:25:38,660 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 21:25:38,662 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 21:25:38,673 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 21:25:38,674 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 21:25:38,675 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 21:25:38,676 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 21:25:38,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 21:25:38,680 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 21:25:38,681 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 21:25:38,682 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 21:25:38,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 21:25:38,683 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 21:25:38,685 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 21:25:38,686 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 21:25:38,687 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 21:25:38,688 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 21:25:38,690 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 21:25:38,693 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 21:25:38,694 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 21:25:38,696 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 21:25:38,697 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 21:25:38,700 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 21:25:38,700 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 21:25:38,700 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 21:25:38,702 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 21:25:38,703 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 21:25:38,704 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 21:25:38,705 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 21:25:38,706 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 21:25:38,706 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 21:25:38,707 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 21:25:38,708 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 21:25:38,708 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 21:25:38,709 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 21:25:38,710 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 21:25:38,710 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 21:25:38,725 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 21:25:38,725 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 21:25:38,727 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 21:25:38,727 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 21:25:38,727 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 21:25:38,728 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 21:25:38,728 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 21:25:38,728 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 21:25:38,728 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 21:25:38,728 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 21:25:38,728 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 21:25:38,729 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 21:25:38,729 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 21:25:38,729 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 21:25:38,729 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 21:25:38,729 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 21:25:38,730 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 21:25:38,731 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 21:25:38,732 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 21:25:38,732 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:25:38,732 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 21:25:38,732 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 21:25:38,732 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 21:25:38,733 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 21:25:38,733 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 21:25:38,734 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 21:25:38,734 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> 4f493a0ec5685991b86ced08697f863f174636a1 [2019-01-14 21:25:38,776 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 21:25:38,788 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 21:25:38,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 21:25:38,793 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 21:25:38,794 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 21:25:38,795 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/Toulouse-MultiBranchesToLoop_false-no-overflow.c [2019-01-14 21:25:38,848 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aac0363fa/b9c7027148c34dab8924119a32eafcb9/FLAGe38a09030 [2019-01-14 21:25:39,231 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 21:25:39,232 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/Toulouse-MultiBranchesToLoop_false-no-overflow.c [2019-01-14 21:25:39,240 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aac0363fa/b9c7027148c34dab8924119a32eafcb9/FLAGe38a09030 [2019-01-14 21:25:39,603 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aac0363fa/b9c7027148c34dab8924119a32eafcb9 [2019-01-14 21:25:39,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 21:25:39,608 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 21:25:39,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 21:25:39,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 21:25:39,612 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 21:25:39,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:25:39" (1/1) ... [2019-01-14 21:25:39,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4667f227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:39, skipping insertion in model container [2019-01-14 21:25:39,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:25:39" (1/1) ... [2019-01-14 21:25:39,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 21:25:39,649 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 21:25:39,874 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:25:39,883 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 21:25:39,914 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:25:39,929 INFO L195 MainTranslator]: Completed translation [2019-01-14 21:25:39,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:39 WrapperNode [2019-01-14 21:25:39,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 21:25:39,931 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 21:25:39,931 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 21:25:39,931 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 21:25:39,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:39" (1/1) ... [2019-01-14 21:25:39,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:39" (1/1) ... [2019-01-14 21:25:39,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 21:25:39,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 21:25:39,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 21:25:39,976 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 21:25:39,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:39" (1/1) ... [2019-01-14 21:25:39,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:39" (1/1) ... [2019-01-14 21:25:39,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:39" (1/1) ... [2019-01-14 21:25:39,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:39" (1/1) ... [2019-01-14 21:25:39,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:39" (1/1) ... [2019-01-14 21:25:39,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:39" (1/1) ... [2019-01-14 21:25:39,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:39" (1/1) ... [2019-01-14 21:25:39,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 21:25:39,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 21:25:39,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 21:25:39,999 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 21:25:40,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:25:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 21:25:40,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 21:25:40,691 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 21:25:40,692 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 21:25:40,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:25:40 BoogieIcfgContainer [2019-01-14 21:25:40,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 21:25:40,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 21:25:40,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 21:25:40,697 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 21:25:40,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 09:25:39" (1/3) ... [2019-01-14 21:25:40,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599d8bed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:25:40, skipping insertion in model container [2019-01-14 21:25:40,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:39" (2/3) ... [2019-01-14 21:25:40,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599d8bed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:25:40, skipping insertion in model container [2019-01-14 21:25:40,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:25:40" (3/3) ... [2019-01-14 21:25:40,700 INFO L112 eAbstractionObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop_false-no-overflow.c [2019-01-14 21:25:40,710 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 21:25:40,716 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 36 error locations. [2019-01-14 21:25:40,731 INFO L257 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2019-01-14 21:25:40,764 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 21:25:40,765 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 21:25:40,765 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 21:25:40,765 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 21:25:40,766 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 21:25:40,766 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 21:25:40,766 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 21:25:40,766 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 21:25:40,766 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 21:25:40,787 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-01-14 21:25:40,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-14 21:25:40,793 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:40,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-14 21:25:40,797 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:40,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:40,804 INFO L82 PathProgramCache]: Analyzing trace with hash 957669, now seen corresponding path program 1 times [2019-01-14 21:25:40,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:40,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:40,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:40,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:40,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:40,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:40,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:40,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 21:25:40,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:25:40,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:25:40,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:25:40,961 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2019-01-14 21:25:41,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:41,601 INFO L93 Difference]: Finished difference Result 181 states and 215 transitions. [2019-01-14 21:25:41,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:25:41,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-14 21:25:41,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:41,614 INFO L225 Difference]: With dead ends: 181 [2019-01-14 21:25:41,614 INFO L226 Difference]: Without dead ends: 92 [2019-01-14 21:25:41,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:25:41,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-14 21:25:41,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2019-01-14 21:25:41,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-14 21:25:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2019-01-14 21:25:41,656 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 4 [2019-01-14 21:25:41,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:41,657 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2019-01-14 21:25:41,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:25:41,657 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2019-01-14 21:25:41,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-14 21:25:41,657 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:41,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-14 21:25:41,659 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:41,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:41,659 INFO L82 PathProgramCache]: Analyzing trace with hash 957477, now seen corresponding path program 1 times [2019-01-14 21:25:41,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:41,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:41,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:41,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:41,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:41,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:41,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:41,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:25:41,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:25:41,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:25:41,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:25:41,688 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 3 states. [2019-01-14 21:25:42,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:42,270 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2019-01-14 21:25:42,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:25:42,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-14 21:25:42,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:42,272 INFO L225 Difference]: With dead ends: 113 [2019-01-14 21:25:42,272 INFO L226 Difference]: Without dead ends: 97 [2019-01-14 21:25:42,275 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 [2019-01-14 21:25:42,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-14 21:25:42,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 81. [2019-01-14 21:25:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-14 21:25:42,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-01-14 21:25:42,295 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 4 [2019-01-14 21:25:42,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:42,296 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-01-14 21:25:42,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:25:42,296 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-01-14 21:25:42,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 21:25:42,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:42,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 21:25:42,300 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:42,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:42,302 INFO L82 PathProgramCache]: Analyzing trace with hash 29747371, now seen corresponding path program 1 times [2019-01-14 21:25:42,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:42,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:42,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:42,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:42,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:42,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:42,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:25:42,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:25:42,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:25:42,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:25:42,340 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 3 states. [2019-01-14 21:25:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:42,562 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2019-01-14 21:25:42,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:25:42,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-14 21:25:42,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:42,566 INFO L225 Difference]: With dead ends: 90 [2019-01-14 21:25:42,566 INFO L226 Difference]: Without dead ends: 89 [2019-01-14 21:25:42,567 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 [2019-01-14 21:25:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-14 21:25:42,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2019-01-14 21:25:42,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-14 21:25:42,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2019-01-14 21:25:42,575 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 5 [2019-01-14 21:25:42,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:42,575 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2019-01-14 21:25:42,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:25:42,575 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2019-01-14 21:25:42,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 21:25:42,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:42,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:42,581 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:42,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:42,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1540529751, now seen corresponding path program 1 times [2019-01-14 21:25:42,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:42,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:42,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:42,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:42,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:42,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:42,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:42,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 21:25:42,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:25:42,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:25:42,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:25:42,645 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 4 states. [2019-01-14 21:25:43,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:43,043 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2019-01-14 21:25:43,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 21:25:43,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-14 21:25:43,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:43,046 INFO L225 Difference]: With dead ends: 129 [2019-01-14 21:25:43,046 INFO L226 Difference]: Without dead ends: 122 [2019-01-14 21:25:43,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:25:43,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-14 21:25:43,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 96. [2019-01-14 21:25:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-14 21:25:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2019-01-14 21:25:43,055 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 7 [2019-01-14 21:25:43,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:43,056 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2019-01-14 21:25:43,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:25:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2019-01-14 21:25:43,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 21:25:43,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:43,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:43,058 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:43,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:43,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1440726131, now seen corresponding path program 1 times [2019-01-14 21:25:43,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:43,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:43,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:43,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:43,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:43,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:43,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:43,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 21:25:43,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:25:43,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:25:43,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:25:43,129 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 4 states. [2019-01-14 21:25:43,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:43,336 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2019-01-14 21:25:43,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 21:25:43,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-14 21:25:43,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:43,337 INFO L225 Difference]: With dead ends: 105 [2019-01-14 21:25:43,338 INFO L226 Difference]: Without dead ends: 104 [2019-01-14 21:25:43,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:25:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-14 21:25:43,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2019-01-14 21:25:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-14 21:25:43,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2019-01-14 21:25:43,347 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 8 [2019-01-14 21:25:43,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:43,347 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2019-01-14 21:25:43,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:25:43,347 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2019-01-14 21:25:43,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 21:25:43,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:43,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:43,349 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:43,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:43,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2098770931, now seen corresponding path program 1 times [2019-01-14 21:25:43,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:43,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:43,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:43,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:43,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:43,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:43,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 21:25:43,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:25:43,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:25:43,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:25:43,417 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 5 states. [2019-01-14 21:25:44,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:44,202 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2019-01-14 21:25:44,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:25:44,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-14 21:25:44,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:44,204 INFO L225 Difference]: With dead ends: 150 [2019-01-14 21:25:44,205 INFO L226 Difference]: Without dead ends: 144 [2019-01-14 21:25:44,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:25:44,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-01-14 21:25:44,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 105. [2019-01-14 21:25:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-14 21:25:44,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2019-01-14 21:25:44,214 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 10 [2019-01-14 21:25:44,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:44,214 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2019-01-14 21:25:44,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:25:44,214 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2019-01-14 21:25:44,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 21:25:44,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:44,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:44,219 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:44,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:44,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1064053241, now seen corresponding path program 1 times [2019-01-14 21:25:44,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:44,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:44,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:44,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:44,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:44,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:44,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 21:25:44,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:25:44,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:25:44,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:25:44,345 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 5 states. [2019-01-14 21:25:44,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:44,536 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2019-01-14 21:25:44,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:25:44,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-01-14 21:25:44,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:44,539 INFO L225 Difference]: With dead ends: 114 [2019-01-14 21:25:44,539 INFO L226 Difference]: Without dead ends: 113 [2019-01-14 21:25:44,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:25:44,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-14 21:25:44,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2019-01-14 21:25:44,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 21:25:44,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2019-01-14 21:25:44,546 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 11 [2019-01-14 21:25:44,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:44,547 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2019-01-14 21:25:44,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:25:44,547 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2019-01-14 21:25:44,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 21:25:44,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:44,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:44,549 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:44,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:44,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1649017929, now seen corresponding path program 1 times [2019-01-14 21:25:44,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:44,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:44,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:44,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:44,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:44,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:44,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:44,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 21:25:44,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 21:25:44,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 21:25:44,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:25:44,629 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 6 states. [2019-01-14 21:25:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:44,988 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2019-01-14 21:25:44,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:25:44,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-01-14 21:25:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:44,991 INFO L225 Difference]: With dead ends: 168 [2019-01-14 21:25:44,991 INFO L226 Difference]: Without dead ends: 163 [2019-01-14 21:25:44,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:25:44,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-14 21:25:45,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 108. [2019-01-14 21:25:45,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 21:25:45,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2019-01-14 21:25:45,012 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 13 [2019-01-14 21:25:45,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:45,012 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2019-01-14 21:25:45,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 21:25:45,012 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2019-01-14 21:25:45,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 21:25:45,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:45,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:45,017 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:45,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:45,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1943421695, now seen corresponding path program 1 times [2019-01-14 21:25:45,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:45,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:45,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:45,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:45,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:45,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:45,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:45,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 21:25:45,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 21:25:45,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 21:25:45,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:25:45,112 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 6 states. [2019-01-14 21:25:45,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:45,404 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2019-01-14 21:25:45,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:25:45,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-14 21:25:45,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:45,407 INFO L225 Difference]: With dead ends: 117 [2019-01-14 21:25:45,407 INFO L226 Difference]: Without dead ends: 116 [2019-01-14 21:25:45,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:25:45,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-14 21:25:45,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2019-01-14 21:25:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 21:25:45,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2019-01-14 21:25:45,414 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 14 [2019-01-14 21:25:45,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:45,414 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2019-01-14 21:25:45,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 21:25:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2019-01-14 21:25:45,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 21:25:45,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:45,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:45,416 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:45,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:45,417 INFO L82 PathProgramCache]: Analyzing trace with hash -57105471, now seen corresponding path program 1 times [2019-01-14 21:25:45,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:45,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:45,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:45,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:45,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:45,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:45,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 21:25:45,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 21:25:45,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 21:25:45,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:25:45,547 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand 7 states. [2019-01-14 21:25:46,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:46,095 INFO L93 Difference]: Finished difference Result 183 states and 192 transitions. [2019-01-14 21:25:46,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 21:25:46,097 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-01-14 21:25:46,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:46,099 INFO L225 Difference]: With dead ends: 183 [2019-01-14 21:25:46,099 INFO L226 Difference]: Without dead ends: 179 [2019-01-14 21:25:46,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:25:46,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-14 21:25:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 105. [2019-01-14 21:25:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-14 21:25:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2019-01-14 21:25:46,104 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 16 [2019-01-14 21:25:46,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:46,104 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2019-01-14 21:25:46,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 21:25:46,104 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2019-01-14 21:25:46,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 21:25:46,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:46,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:46,107 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:46,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:46,107 INFO L82 PathProgramCache]: Analyzing trace with hash -316464313, now seen corresponding path program 1 times [2019-01-14 21:25:46,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:46,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:46,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:46,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:46,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:46,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:46,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 21:25:46,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 21:25:46,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 21:25:46,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:25:46,293 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 7 states. [2019-01-14 21:25:46,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:46,612 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2019-01-14 21:25:46,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 21:25:46,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-01-14 21:25:46,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:46,615 INFO L225 Difference]: With dead ends: 114 [2019-01-14 21:25:46,615 INFO L226 Difference]: Without dead ends: 113 [2019-01-14 21:25:46,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:25:46,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-14 21:25:46,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2019-01-14 21:25:46,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 21:25:46,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2019-01-14 21:25:46,619 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 17 [2019-01-14 21:25:46,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:46,619 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2019-01-14 21:25:46,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 21:25:46,620 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2019-01-14 21:25:46,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 21:25:46,621 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:46,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:46,622 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:46,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:46,622 INFO L82 PathProgramCache]: Analyzing trace with hash -421937723, now seen corresponding path program 1 times [2019-01-14 21:25:46,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:46,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:46,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:46,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:46,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:46,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:46,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 21:25:46,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 21:25:46,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 21:25:46,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:25:46,959 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 8 states. [2019-01-14 21:25:48,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:48,193 INFO L93 Difference]: Finished difference Result 195 states and 204 transitions. [2019-01-14 21:25:48,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 21:25:48,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-01-14 21:25:48,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:48,197 INFO L225 Difference]: With dead ends: 195 [2019-01-14 21:25:48,197 INFO L226 Difference]: Without dead ends: 192 [2019-01-14 21:25:48,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:25:48,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-01-14 21:25:48,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 96. [2019-01-14 21:25:48,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-14 21:25:48,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2019-01-14 21:25:48,201 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 19 [2019-01-14 21:25:48,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:48,201 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2019-01-14 21:25:48,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 21:25:48,202 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2019-01-14 21:25:48,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 21:25:48,203 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:48,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:48,204 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:48,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:48,204 INFO L82 PathProgramCache]: Analyzing trace with hash -335018609, now seen corresponding path program 1 times [2019-01-14 21:25:48,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:48,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:48,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:48,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:48,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:48,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:48,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:48,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 21:25:48,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 21:25:48,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 21:25:48,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:25:48,300 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 8 states. [2019-01-14 21:25:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:48,477 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2019-01-14 21:25:48,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 21:25:48,478 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-01-14 21:25:48,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:48,480 INFO L225 Difference]: With dead ends: 105 [2019-01-14 21:25:48,480 INFO L226 Difference]: Without dead ends: 104 [2019-01-14 21:25:48,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:25:48,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-14 21:25:48,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2019-01-14 21:25:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-14 21:25:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2019-01-14 21:25:48,483 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 20 [2019-01-14 21:25:48,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:48,484 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2019-01-14 21:25:48,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 21:25:48,484 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2019-01-14 21:25:48,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 21:25:48,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:48,485 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:48,486 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:48,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:48,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1422683023, now seen corresponding path program 1 times [2019-01-14 21:25:48,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:48,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:48,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:48,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:48,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:48,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:48,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:48,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 21:25:48,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 21:25:48,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 21:25:48,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 21:25:48,565 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 9 states. [2019-01-14 21:25:49,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:49,222 INFO L93 Difference]: Finished difference Result 204 states and 213 transitions. [2019-01-14 21:25:49,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 21:25:49,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-01-14 21:25:49,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:49,226 INFO L225 Difference]: With dead ends: 204 [2019-01-14 21:25:49,226 INFO L226 Difference]: Without dead ends: 202 [2019-01-14 21:25:49,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 21:25:49,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-01-14 21:25:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 81. [2019-01-14 21:25:49,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-14 21:25:49,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-01-14 21:25:49,230 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 22 [2019-01-14 21:25:49,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:49,230 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-01-14 21:25:49,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 21:25:49,230 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-01-14 21:25:49,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 21:25:49,231 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:49,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:49,232 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:49,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:49,233 INFO L82 PathProgramCache]: Analyzing trace with hash 964744341, now seen corresponding path program 1 times [2019-01-14 21:25:49,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:49,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:49,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:49,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:49,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:49,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:49,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 21:25:49,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 21:25:49,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 21:25:49,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 21:25:49,355 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 9 states. [2019-01-14 21:25:49,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:49,526 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2019-01-14 21:25:49,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 21:25:49,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-01-14 21:25:49,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:49,528 INFO L225 Difference]: With dead ends: 90 [2019-01-14 21:25:49,529 INFO L226 Difference]: Without dead ends: 89 [2019-01-14 21:25:49,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 21:25:49,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-14 21:25:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2019-01-14 21:25:49,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-14 21:25:49,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2019-01-14 21:25:49,537 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 23 [2019-01-14 21:25:49,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:49,537 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2019-01-14 21:25:49,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 21:25:49,537 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2019-01-14 21:25:49,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 21:25:49,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:49,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:49,538 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:49,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:49,542 INFO L82 PathProgramCache]: Analyzing trace with hash 412788691, now seen corresponding path program 1 times [2019-01-14 21:25:49,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:49,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:49,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:49,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:49,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:49,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:49,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 21:25:49,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 21:25:49,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 21:25:49,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 21:25:49,627 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 10 states. [2019-01-14 21:25:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:50,117 INFO L93 Difference]: Finished difference Result 210 states and 219 transitions. [2019-01-14 21:25:50,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 21:25:50,118 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-01-14 21:25:50,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:50,119 INFO L225 Difference]: With dead ends: 210 [2019-01-14 21:25:50,119 INFO L226 Difference]: Without dead ends: 209 [2019-01-14 21:25:50,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 21:25:50,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-14 21:25:50,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 60. [2019-01-14 21:25:50,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-14 21:25:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2019-01-14 21:25:50,123 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 25 [2019-01-14 21:25:50,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:50,123 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2019-01-14 21:25:50,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 21:25:50,124 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2019-01-14 21:25:50,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 21:25:50,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:50,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:50,126 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:50,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:50,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1222339043, now seen corresponding path program 1 times [2019-01-14 21:25:50,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:50,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:50,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:50,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:50,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:50,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:50,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:50,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 21:25:50,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 21:25:50,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 21:25:50,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 21:25:50,299 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 10 states. [2019-01-14 21:25:50,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:50,569 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2019-01-14 21:25:50,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 21:25:50,570 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-01-14 21:25:50,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:50,571 INFO L225 Difference]: With dead ends: 69 [2019-01-14 21:25:50,572 INFO L226 Difference]: Without dead ends: 68 [2019-01-14 21:25:50,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 21:25:50,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-14 21:25:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2019-01-14 21:25:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-14 21:25:50,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-01-14 21:25:50,574 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 26 [2019-01-14 21:25:50,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:50,575 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-01-14 21:25:50,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 21:25:50,575 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-01-14 21:25:50,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 21:25:50,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:50,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:50,577 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:50,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:50,577 INFO L82 PathProgramCache]: Analyzing trace with hash 896666621, now seen corresponding path program 1 times [2019-01-14 21:25:50,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:50,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:50,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:50,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:50,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:50,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:50,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 21:25:50,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 21:25:50,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 21:25:50,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-01-14 21:25:50,692 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 12 states. [2019-01-14 21:25:53,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:53,296 INFO L93 Difference]: Finished difference Result 200 states and 217 transitions. [2019-01-14 21:25:53,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 21:25:53,298 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-01-14 21:25:53,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:53,299 INFO L225 Difference]: With dead ends: 200 [2019-01-14 21:25:53,300 INFO L226 Difference]: Without dead ends: 199 [2019-01-14 21:25:53,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2019-01-14 21:25:53,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-14 21:25:53,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 58. [2019-01-14 21:25:53,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-14 21:25:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2019-01-14 21:25:53,303 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 28 [2019-01-14 21:25:53,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:53,303 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2019-01-14 21:25:53,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 21:25:53,304 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2019-01-14 21:25:53,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 21:25:53,304 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:53,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:53,305 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:53,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:53,306 INFO L82 PathProgramCache]: Analyzing trace with hash 2026861636, now seen corresponding path program 1 times [2019-01-14 21:25:53,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:53,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:53,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:53,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:53,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:53,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:53,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:53,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 21:25:53,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 21:25:53,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 21:25:53,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-01-14 21:25:53,534 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand 12 states. [2019-01-14 21:25:53,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:53,928 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2019-01-14 21:25:53,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 21:25:53,929 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-01-14 21:25:53,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:53,932 INFO L225 Difference]: With dead ends: 160 [2019-01-14 21:25:53,933 INFO L226 Difference]: Without dead ends: 159 [2019-01-14 21:25:53,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2019-01-14 21:25:53,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-14 21:25:53,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 61. [2019-01-14 21:25:53,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-14 21:25:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-01-14 21:25:53,937 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 29 [2019-01-14 21:25:53,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:53,938 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-01-14 21:25:53,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 21:25:53,938 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-01-14 21:25:53,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 21:25:53,938 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:53,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:53,939 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:53,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:53,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1969538558, now seen corresponding path program 1 times [2019-01-14 21:25:53,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:53,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:53,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:53,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:53,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 21:25:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 21:25:53,980 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 21:25:54,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 09:25:54 BoogieIcfgContainer [2019-01-14 21:25:54,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 21:25:54,011 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 21:25:54,011 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 21:25:54,011 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 21:25:54,011 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:25:40" (3/4) ... [2019-01-14 21:25:54,015 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 21:25:54,064 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 21:25:54,064 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 21:25:54,065 INFO L168 Benchmark]: Toolchain (without parser) took 14458.04 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 291.5 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -140.3 MB). Peak memory consumption was 151.2 MB. Max. memory is 11.5 GB. [2019-01-14 21:25:54,067 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:25:54,067 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.75 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 21:25:54,068 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.31 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:25:54,068 INFO L168 Benchmark]: Boogie Preprocessor took 23.11 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 21:25:54,069 INFO L168 Benchmark]: RCFGBuilder took 694.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -148.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 21:25:54,069 INFO L168 Benchmark]: TraceAbstraction took 13316.54 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.8 MB). Peak memory consumption was 166.7 MB. Max. memory is 11.5 GB. [2019-01-14 21:25:54,070 INFO L168 Benchmark]: Witness Printer took 53.06 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-01-14 21:25:54,074 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 321.75 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 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 44.31 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.11 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 694.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -148.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13316.54 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.8 MB). Peak memory consumption was 166.7 MB. Max. memory is 11.5 GB. * Witness Printer took 53.06 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 65]: integer overflow possible integer overflow possible We found a FailurePath: [L14] int x; [L15] int y; [L16] int z; [L17] y = __VERIFIER_nondet_int() [L18] z = __VERIFIER_nondet_int() [L19] COND FALSE !(__VERIFIER_nondet_int() != 0) [L22] x = -1 [L24] COND FALSE !(x > 0) [L27] EXPR x - 1 [L27] x = x - 1 [L29] COND FALSE !(x > 0) [L32] EXPR x - 1 [L32] x = x - 1 [L34] COND FALSE !(x > 0) [L37] EXPR x - 1 [L37] x = x - 1 [L39] COND FALSE !(x > 0) [L42] EXPR x - 1 [L42] x = x - 1 [L44] COND FALSE !(x > 0) [L47] EXPR x - 1 [L47] x = x - 1 [L49] COND FALSE !(x > 0) [L52] EXPR x - 1 [L52] x = x - 1 [L54] COND FALSE !(x > 0) [L57] EXPR x - 1 [L57] x = x - 1 [L59] COND FALSE !(x > 0) [L62] EXPR x - 1 [L62] x = x - 1 [L64] COND TRUE y<100 && z<100 [L65] y+x - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 87 locations, 36 error locations. UNSAFE Result, 13.2s OverallTime, 20 OverallIterations, 1 TraceHistogramMax, 10.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 464 SDtfs, 1764 SDslu, 162 SDs, 0 SdLazy, 5610 SolverSat, 718 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 896 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 22006 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...