./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/bitvector/byte_add_false-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/bitvector/byte_add_false-no-overflow.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash 6af52310ec13e6e7a94146d05f9e904086453aae ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 01:57:32,700 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 01:57:32,702 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 01:57:32,714 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 01:57:32,714 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 01:57:32,715 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 01:57:32,716 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 01:57:32,718 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 01:57:32,720 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 01:57:32,720 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 01:57:32,721 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 01:57:32,721 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 01:57:32,722 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 01:57:32,723 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 01:57:32,724 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 01:57:32,725 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 01:57:32,726 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 01:57:32,728 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 01:57:32,730 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 01:57:32,732 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 01:57:32,733 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 01:57:32,735 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 01:57:32,737 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 01:57:32,737 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 01:57:32,738 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 01:57:32,739 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 01:57:32,740 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 01:57:32,741 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 01:57:32,741 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 01:57:32,743 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 01:57:32,743 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 01:57:32,744 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 01:57:32,744 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 01:57:32,744 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 01:57:32,745 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 01:57:32,746 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 01:57:32,746 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-01-14 01:57:32,762 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 01:57:32,762 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 01:57:32,763 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 01:57:32,764 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 01:57:32,764 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 01:57:32,764 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 01:57:32,764 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 01:57:32,764 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 01:57:32,765 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 01:57:32,768 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 01:57:32,768 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 01:57:32,768 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 01:57:32,768 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 01:57:32,769 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 01:57:32,769 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 01:57:32,769 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 01:57:32,769 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 01:57:32,769 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 01:57:32,769 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 01:57:32,772 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 01:57:32,772 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 01:57:32,772 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 01:57:32,772 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 01:57:32,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:57:32,773 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 01:57:32,773 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 01:57:32,773 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 01:57:32,773 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 01:57:32,773 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 01:57:32,774 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 01:57:32,774 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6af52310ec13e6e7a94146d05f9e904086453aae [2019-01-14 01:57:32,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 01:57:32,850 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 01:57:32,854 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 01:57:32,855 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 01:57:32,856 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 01:57:32,856 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/byte_add_false-no-overflow.i [2019-01-14 01:57:32,910 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76b5f1daa/e97ce904762343a0ae1c79f3973eb1cf/FLAGd38a7e5d4 [2019-01-14 01:57:33,304 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 01:57:33,305 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/byte_add_false-no-overflow.i [2019-01-14 01:57:33,311 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76b5f1daa/e97ce904762343a0ae1c79f3973eb1cf/FLAGd38a7e5d4 [2019-01-14 01:57:33,676 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76b5f1daa/e97ce904762343a0ae1c79f3973eb1cf [2019-01-14 01:57:33,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 01:57:33,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 01:57:33,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 01:57:33,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 01:57:33,685 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 01:57:33,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:57:33" (1/1) ... [2019-01-14 01:57:33,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3351f92d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:33, skipping insertion in model container [2019-01-14 01:57:33,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:57:33" (1/1) ... [2019-01-14 01:57:33,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 01:57:33,726 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 01:57:34,004 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:57:34,010 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 01:57:34,086 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:57:34,104 INFO L195 MainTranslator]: Completed translation [2019-01-14 01:57:34,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:34 WrapperNode [2019-01-14 01:57:34,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 01:57:34,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 01:57:34,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 01:57:34,106 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 01:57:34,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:34" (1/1) ... [2019-01-14 01:57:34,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:34" (1/1) ... [2019-01-14 01:57:34,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 01:57:34,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 01:57:34,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 01:57:34,176 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 01:57:34,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:34" (1/1) ... [2019-01-14 01:57:34,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:34" (1/1) ... [2019-01-14 01:57:34,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:34" (1/1) ... [2019-01-14 01:57:34,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:34" (1/1) ... [2019-01-14 01:57:34,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:34" (1/1) ... [2019-01-14 01:57:34,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:34" (1/1) ... [2019-01-14 01:57:34,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:34" (1/1) ... [2019-01-14 01:57:34,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 01:57:34,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 01:57:34,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 01:57:34,283 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 01:57:34,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:34" (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 01:57:34,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 01:57:34,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 01:57:35,208 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 01:57:35,208 INFO L286 CfgBuilder]: Removed 10 assue(true) statements. [2019-01-14 01:57:35,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:57:35 BoogieIcfgContainer [2019-01-14 01:57:35,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 01:57:35,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 01:57:35,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 01:57:35,215 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 01:57:35,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 01:57:33" (1/3) ... [2019-01-14 01:57:35,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3353bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:57:35, skipping insertion in model container [2019-01-14 01:57:35,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:57:34" (2/3) ... [2019-01-14 01:57:35,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3353bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:57:35, skipping insertion in model container [2019-01-14 01:57:35,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:57:35" (3/3) ... [2019-01-14 01:57:35,220 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-no-overflow.i [2019-01-14 01:57:35,231 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 01:57:35,245 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2019-01-14 01:57:35,263 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2019-01-14 01:57:35,310 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 01:57:35,310 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 01:57:35,311 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 01:57:35,311 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 01:57:35,311 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 01:57:35,311 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 01:57:35,311 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 01:57:35,312 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 01:57:35,312 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 01:57:35,341 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-01-14 01:57:35,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-14 01:57:35,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:35,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-14 01:57:35,356 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:35,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:35,363 INFO L82 PathProgramCache]: Analyzing trace with hash 30881, now seen corresponding path program 1 times [2019-01-14 01:57:35,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:35,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:35,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:35,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:35,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:35,520 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 01:57:35,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:35,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:57:35,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 01:57:35,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 01:57:35,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 01:57:35,546 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-01-14 01:57:35,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:35,580 INFO L93 Difference]: Finished difference Result 134 states and 176 transitions. [2019-01-14 01:57:35,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 01:57:35,584 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 3 [2019-01-14 01:57:35,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:35,597 INFO L225 Difference]: With dead ends: 134 [2019-01-14 01:57:35,598 INFO L226 Difference]: Without dead ends: 68 [2019-01-14 01:57:35,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 01:57:35,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-14 01:57:35,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-14 01:57:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 01:57:35,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2019-01-14 01:57:35,653 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 3 [2019-01-14 01:57:35,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:35,654 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2019-01-14 01:57:35,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 01:57:35,654 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2019-01-14 01:57:35,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 01:57:35,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:35,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:35,657 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:35,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:35,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1126401592, now seen corresponding path program 1 times [2019-01-14 01:57:35,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:35,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:35,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:35,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:35,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:35,857 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-14 01:57:35,873 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 01:57:35,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:35,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:57:35,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:57:35,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:57:35,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:57:35,876 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand 3 states. [2019-01-14 01:57:36,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:36,256 INFO L93 Difference]: Finished difference Result 144 states and 211 transitions. [2019-01-14 01:57:36,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:57:36,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-14 01:57:36,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:36,258 INFO L225 Difference]: With dead ends: 144 [2019-01-14 01:57:36,258 INFO L226 Difference]: Without dead ends: 97 [2019-01-14 01:57:36,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:57:36,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-14 01:57:36,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-01-14 01:57:36,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 01:57:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 123 transitions. [2019-01-14 01:57:36,271 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 123 transitions. Word has length 12 [2019-01-14 01:57:36,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:36,272 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 123 transitions. [2019-01-14 01:57:36,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:57:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2019-01-14 01:57:36,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 01:57:36,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:36,273 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 01:57:36,275 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:36,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:36,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1247347973, now seen corresponding path program 1 times [2019-01-14 01:57:36,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:36,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:36,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:36,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:36,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:36,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:57:36,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:36,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:57:36,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:57:36,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:57:36,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:57:36,442 INFO L87 Difference]: Start difference. First operand 93 states and 123 transitions. Second operand 4 states. [2019-01-14 01:57:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:37,257 INFO L93 Difference]: Finished difference Result 213 states and 316 transitions. [2019-01-14 01:57:37,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:57:37,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-01-14 01:57:37,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:37,261 INFO L225 Difference]: With dead ends: 213 [2019-01-14 01:57:37,261 INFO L226 Difference]: Without dead ends: 166 [2019-01-14 01:57:37,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:57:37,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-14 01:57:37,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 118. [2019-01-14 01:57:37,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-14 01:57:37,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 160 transitions. [2019-01-14 01:57:37,274 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 160 transitions. Word has length 19 [2019-01-14 01:57:37,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:37,275 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 160 transitions. [2019-01-14 01:57:37,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:57:37,275 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 160 transitions. [2019-01-14 01:57:37,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 01:57:37,276 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:37,277 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:37,278 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:37,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:37,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1023692700, now seen corresponding path program 1 times [2019-01-14 01:57:37,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:37,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:37,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:37,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:37,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 01:57:37,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:37,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:57:37,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:57:37,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:57:37,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:57:37,454 INFO L87 Difference]: Start difference. First operand 118 states and 160 transitions. Second operand 4 states. [2019-01-14 01:57:37,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:37,834 INFO L93 Difference]: Finished difference Result 313 states and 446 transitions. [2019-01-14 01:57:37,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:57:37,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-01-14 01:57:37,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:37,838 INFO L225 Difference]: With dead ends: 313 [2019-01-14 01:57:37,838 INFO L226 Difference]: Without dead ends: 221 [2019-01-14 01:57:37,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:57:37,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-01-14 01:57:37,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 157. [2019-01-14 01:57:37,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-14 01:57:37,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 221 transitions. [2019-01-14 01:57:37,854 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 221 transitions. Word has length 26 [2019-01-14 01:57:37,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:37,854 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 221 transitions. [2019-01-14 01:57:37,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:57:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 221 transitions. [2019-01-14 01:57:37,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 01:57:37,856 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:37,857 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:37,858 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:37,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:37,859 INFO L82 PathProgramCache]: Analyzing trace with hash -421998743, now seen corresponding path program 1 times [2019-01-14 01:57:37,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:37,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:37,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:37,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:37,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-14 01:57:38,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:38,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:57:38,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:57:38,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:57:38,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:57:38,011 INFO L87 Difference]: Start difference. First operand 157 states and 221 transitions. Second operand 5 states. [2019-01-14 01:57:39,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:39,007 INFO L93 Difference]: Finished difference Result 454 states and 637 transitions. [2019-01-14 01:57:39,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:57:39,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-01-14 01:57:39,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:39,012 INFO L225 Difference]: With dead ends: 454 [2019-01-14 01:57:39,012 INFO L226 Difference]: Without dead ends: 321 [2019-01-14 01:57:39,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:57:39,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-01-14 01:57:39,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 170. [2019-01-14 01:57:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-01-14 01:57:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 237 transitions. [2019-01-14 01:57:39,029 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 237 transitions. Word has length 33 [2019-01-14 01:57:39,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:39,029 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 237 transitions. [2019-01-14 01:57:39,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:57:39,030 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 237 transitions. [2019-01-14 01:57:39,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 01:57:39,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:39,032 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:39,033 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:39,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:39,033 INFO L82 PathProgramCache]: Analyzing trace with hash 337056594, now seen corresponding path program 1 times [2019-01-14 01:57:39,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:39,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:39,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:39,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:39,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:39,245 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-14 01:57:39,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:39,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 01:57:39,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:57:39,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:57:39,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:57:39,246 INFO L87 Difference]: Start difference. First operand 170 states and 237 transitions. Second operand 5 states. [2019-01-14 01:57:39,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:39,754 INFO L93 Difference]: Finished difference Result 460 states and 643 transitions. [2019-01-14 01:57:39,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:57:39,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-01-14 01:57:39,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:39,758 INFO L225 Difference]: With dead ends: 460 [2019-01-14 01:57:39,758 INFO L226 Difference]: Without dead ends: 327 [2019-01-14 01:57:39,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:57:39,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-01-14 01:57:39,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 183. [2019-01-14 01:57:39,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-01-14 01:57:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 251 transitions. [2019-01-14 01:57:39,771 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 251 transitions. Word has length 36 [2019-01-14 01:57:39,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:39,772 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 251 transitions. [2019-01-14 01:57:39,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:57:39,772 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 251 transitions. [2019-01-14 01:57:39,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 01:57:39,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:39,774 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:39,775 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:39,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:39,776 INFO L82 PathProgramCache]: Analyzing trace with hash -466613948, now seen corresponding path program 1 times [2019-01-14 01:57:39,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:39,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:39,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:39,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:39,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 01:57:39,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:57:39,999 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:57:40,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:40,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:57:40,123 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 01:57:40,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:57:40,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-14 01:57:40,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:57:40,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:57:40,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:57:40,154 INFO L87 Difference]: Start difference. First operand 183 states and 251 transitions. Second operand 7 states. [2019-01-14 01:57:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:41,583 INFO L93 Difference]: Finished difference Result 420 states and 611 transitions. [2019-01-14 01:57:41,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:57:41,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-01-14 01:57:41,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:41,587 INFO L225 Difference]: With dead ends: 420 [2019-01-14 01:57:41,588 INFO L226 Difference]: Without dead ends: 285 [2019-01-14 01:57:41,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:57:41,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-01-14 01:57:41,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 229. [2019-01-14 01:57:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-14 01:57:41,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 289 transitions. [2019-01-14 01:57:41,619 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 289 transitions. Word has length 39 [2019-01-14 01:57:41,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:41,620 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 289 transitions. [2019-01-14 01:57:41,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:57:41,620 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 289 transitions. [2019-01-14 01:57:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-14 01:57:41,623 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:41,623 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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 01:57:41,625 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:41,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:41,626 INFO L82 PathProgramCache]: Analyzing trace with hash -811417915, now seen corresponding path program 1 times [2019-01-14 01:57:41,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:41,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:41,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:41,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:41,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-14 01:57:41,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:41,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:57:41,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:57:41,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:57:41,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:57:41,761 INFO L87 Difference]: Start difference. First operand 229 states and 289 transitions. Second operand 3 states. [2019-01-14 01:57:41,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:41,816 INFO L93 Difference]: Finished difference Result 273 states and 338 transitions. [2019-01-14 01:57:41,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:57:41,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-01-14 01:57:41,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:41,819 INFO L225 Difference]: With dead ends: 273 [2019-01-14 01:57:41,819 INFO L226 Difference]: Without dead ends: 196 [2019-01-14 01:57:41,821 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 01:57:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-14 01:57:41,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-01-14 01:57:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-14 01:57:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 246 transitions. [2019-01-14 01:57:41,830 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 246 transitions. Word has length 46 [2019-01-14 01:57:41,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:41,830 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 246 transitions. [2019-01-14 01:57:41,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:57:41,830 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 246 transitions. [2019-01-14 01:57:41,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-14 01:57:41,836 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:41,837 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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 01:57:41,838 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:41,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:41,838 INFO L82 PathProgramCache]: Analyzing trace with hash 669122321, now seen corresponding path program 1 times [2019-01-14 01:57:41,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:41,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:41,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:41,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:41,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:42,173 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-14 01:57:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-01-14 01:57:42,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:42,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 01:57:42,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:57:42,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:57:42,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:57:42,199 INFO L87 Difference]: Start difference. First operand 196 states and 246 transitions. Second operand 5 states. [2019-01-14 01:57:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:42,913 INFO L93 Difference]: Finished difference Result 552 states and 694 transitions. [2019-01-14 01:57:42,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:57:42,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-01-14 01:57:42,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:42,916 INFO L225 Difference]: With dead ends: 552 [2019-01-14 01:57:42,916 INFO L226 Difference]: Without dead ends: 406 [2019-01-14 01:57:42,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:57:42,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-01-14 01:57:42,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 247. [2019-01-14 01:57:42,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-14 01:57:42,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 310 transitions. [2019-01-14 01:57:42,927 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 310 transitions. Word has length 58 [2019-01-14 01:57:42,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:42,928 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 310 transitions. [2019-01-14 01:57:42,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:57:42,928 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 310 transitions. [2019-01-14 01:57:42,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-14 01:57:42,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:42,929 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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 01:57:42,930 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:42,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:42,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2018692145, now seen corresponding path program 1 times [2019-01-14 01:57:42,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:42,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:42,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:42,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:42,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:43,025 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-01-14 01:57:43,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:43,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:57:43,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:57:43,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:57:43,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:57:43,026 INFO L87 Difference]: Start difference. First operand 247 states and 310 transitions. Second operand 3 states. [2019-01-14 01:57:43,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:43,047 INFO L93 Difference]: Finished difference Result 260 states and 323 transitions. [2019-01-14 01:57:43,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:57:43,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-01-14 01:57:43,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:43,050 INFO L225 Difference]: With dead ends: 260 [2019-01-14 01:57:43,050 INFO L226 Difference]: Without dead ends: 247 [2019-01-14 01:57:43,051 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 01:57:43,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-14 01:57:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-01-14 01:57:43,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-14 01:57:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 309 transitions. [2019-01-14 01:57:43,061 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 309 transitions. Word has length 61 [2019-01-14 01:57:43,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:43,061 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 309 transitions. [2019-01-14 01:57:43,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:57:43,061 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 309 transitions. [2019-01-14 01:57:43,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-14 01:57:43,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:43,064 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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 01:57:43,065 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:43,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:43,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1007574895, now seen corresponding path program 1 times [2019-01-14 01:57:43,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:43,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:43,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:43,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:43,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:43,311 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-14 01:57:43,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:43,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:57:43,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:57:43,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:57:43,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:57:43,312 INFO L87 Difference]: Start difference. First operand 247 states and 309 transitions. Second operand 4 states. [2019-01-14 01:57:43,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:43,560 INFO L93 Difference]: Finished difference Result 553 states and 688 transitions. [2019-01-14 01:57:43,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:57:43,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-01-14 01:57:43,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:43,566 INFO L225 Difference]: With dead ends: 553 [2019-01-14 01:57:43,566 INFO L226 Difference]: Without dead ends: 356 [2019-01-14 01:57:43,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:57:43,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-01-14 01:57:43,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 261. [2019-01-14 01:57:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-01-14 01:57:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 333 transitions. [2019-01-14 01:57:43,583 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 333 transitions. Word has length 61 [2019-01-14 01:57:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:43,583 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 333 transitions. [2019-01-14 01:57:43,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:57:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 333 transitions. [2019-01-14 01:57:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-14 01:57:43,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:43,586 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:43,589 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:43,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:43,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1454389477, now seen corresponding path program 1 times [2019-01-14 01:57:43,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:43,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:43,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:43,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:43,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:44,226 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-01-14 01:57:44,431 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 01:57:44,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:44,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 01:57:44,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:57:44,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:57:44,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:57:44,434 INFO L87 Difference]: Start difference. First operand 261 states and 333 transitions. Second operand 7 states. [2019-01-14 01:57:45,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:45,384 INFO L93 Difference]: Finished difference Result 772 states and 1003 transitions. [2019-01-14 01:57:45,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:57:45,385 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-01-14 01:57:45,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:45,389 INFO L225 Difference]: With dead ends: 772 [2019-01-14 01:57:45,389 INFO L226 Difference]: Without dead ends: 550 [2019-01-14 01:57:45,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:57:45,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-01-14 01:57:45,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 509. [2019-01-14 01:57:45,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-01-14 01:57:45,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 649 transitions. [2019-01-14 01:57:45,410 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 649 transitions. Word has length 67 [2019-01-14 01:57:45,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:45,411 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 649 transitions. [2019-01-14 01:57:45,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:57:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 649 transitions. [2019-01-14 01:57:45,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-14 01:57:45,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:45,412 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:45,415 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:45,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:45,416 INFO L82 PathProgramCache]: Analyzing trace with hash 2083812095, now seen corresponding path program 1 times [2019-01-14 01:57:45,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:45,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:45,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:45,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:45,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:45,755 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-14 01:57:45,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:57:45,755 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:57:45,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:45,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:57:45,872 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-14 01:57:45,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:57:45,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2019-01-14 01:57:45,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:57:45,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:57:45,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:57:45,904 INFO L87 Difference]: Start difference. First operand 509 states and 649 transitions. Second operand 7 states. [2019-01-14 01:57:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:48,303 INFO L93 Difference]: Finished difference Result 2680 states and 3314 transitions. [2019-01-14 01:57:48,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 01:57:48,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-01-14 01:57:48,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:48,313 INFO L225 Difference]: With dead ends: 2680 [2019-01-14 01:57:48,314 INFO L226 Difference]: Without dead ends: 2026 [2019-01-14 01:57:48,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-01-14 01:57:48,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2019-01-14 01:57:48,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 869. [2019-01-14 01:57:48,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-01-14 01:57:48,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1184 transitions. [2019-01-14 01:57:48,359 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1184 transitions. Word has length 67 [2019-01-14 01:57:48,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:48,359 INFO L480 AbstractCegarLoop]: Abstraction has 869 states and 1184 transitions. [2019-01-14 01:57:48,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:57:48,359 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1184 transitions. [2019-01-14 01:57:48,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-14 01:57:48,363 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:48,363 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:48,365 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:48,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:48,371 INFO L82 PathProgramCache]: Analyzing trace with hash 855628834, now seen corresponding path program 1 times [2019-01-14 01:57:48,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:48,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:48,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:48,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:48,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:48,509 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 01:57:48,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:57:48,509 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:57:48,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:48,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:57:49,623 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-14 01:57:49,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:57:49,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2019-01-14 01:57:49,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:57:49,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:57:49,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=31, Unknown=3, NotChecked=0, Total=56 [2019-01-14 01:57:49,642 INFO L87 Difference]: Start difference. First operand 869 states and 1184 transitions. Second operand 8 states. [2019-01-14 01:57:53,266 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 01:57:58,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:58,951 INFO L93 Difference]: Finished difference Result 2166 states and 2929 transitions. [2019-01-14 01:57:58,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 01:57:58,952 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2019-01-14 01:57:58,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:58,959 INFO L225 Difference]: With dead ends: 2166 [2019-01-14 01:57:58,959 INFO L226 Difference]: Without dead ends: 1262 [2019-01-14 01:57:58,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=45, Invalid=62, Unknown=3, NotChecked=0, Total=110 [2019-01-14 01:57:58,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2019-01-14 01:57:59,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1071. [2019-01-14 01:57:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1071 states. [2019-01-14 01:57:59,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1458 transitions. [2019-01-14 01:57:59,010 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1458 transitions. Word has length 73 [2019-01-14 01:57:59,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:59,010 INFO L480 AbstractCegarLoop]: Abstraction has 1071 states and 1458 transitions. [2019-01-14 01:57:59,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:57:59,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1458 transitions. [2019-01-14 01:57:59,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-14 01:57:59,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:59,015 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:57:59,017 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:59,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:59,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1090909143, now seen corresponding path program 1 times [2019-01-14 01:57:59,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:59,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:59,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:59,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:59,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-01-14 01:57:59,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:57:59,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 01:57:59,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:57:59,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:57:59,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:57:59,270 INFO L87 Difference]: Start difference. First operand 1071 states and 1458 transitions. Second operand 7 states. [2019-01-14 01:58:01,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:58:01,070 INFO L93 Difference]: Finished difference Result 3380 states and 4566 transitions. [2019-01-14 01:58:01,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 01:58:01,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-01-14 01:58:01,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:58:01,078 INFO L225 Difference]: With dead ends: 3380 [2019-01-14 01:58:01,079 INFO L226 Difference]: Without dead ends: 2160 [2019-01-14 01:58:01,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-14 01:58:01,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2019-01-14 01:58:01,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 1869. [2019-01-14 01:58:01,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1869 states. [2019-01-14 01:58:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2519 transitions. [2019-01-14 01:58:01,150 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2519 transitions. Word has length 79 [2019-01-14 01:58:01,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:58:01,150 INFO L480 AbstractCegarLoop]: Abstraction has 1869 states and 2519 transitions. [2019-01-14 01:58:01,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:58:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2519 transitions. [2019-01-14 01:58:01,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-14 01:58:01,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:58:01,154 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:58:01,156 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:58:01,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:58:01,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1286610050, now seen corresponding path program 1 times [2019-01-14 01:58:01,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:58:01,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:58:01,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:58:01,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:58:01,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:58:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:58:01,792 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2019-01-14 01:58:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-14 01:58:01,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:58:01,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 01:58:01,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:58:01,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:58:01,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:58:01,829 INFO L87 Difference]: Start difference. First operand 1869 states and 2519 transitions. Second operand 7 states. [2019-01-14 01:58:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:58:02,875 INFO L93 Difference]: Finished difference Result 6544 states and 8730 transitions. [2019-01-14 01:58:02,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 01:58:02,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-01-14 01:58:02,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:58:02,889 INFO L225 Difference]: With dead ends: 6544 [2019-01-14 01:58:02,889 INFO L226 Difference]: Without dead ends: 4400 [2019-01-14 01:58:02,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:58:02,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4400 states. [2019-01-14 01:58:03,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4400 to 4121. [2019-01-14 01:58:03,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4121 states. [2019-01-14 01:58:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4121 states to 4121 states and 5514 transitions. [2019-01-14 01:58:03,087 INFO L78 Accepts]: Start accepts. Automaton has 4121 states and 5514 transitions. Word has length 79 [2019-01-14 01:58:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:58:03,087 INFO L480 AbstractCegarLoop]: Abstraction has 4121 states and 5514 transitions. [2019-01-14 01:58:03,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:58:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 4121 states and 5514 transitions. [2019-01-14 01:58:03,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-14 01:58:03,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:58:03,093 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:58:03,094 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:58:03,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:58:03,099 INFO L82 PathProgramCache]: Analyzing trace with hash -2026749083, now seen corresponding path program 1 times [2019-01-14 01:58:03,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:58:03,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:58:03,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:58:03,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:58:03,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:58:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:58:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-01-14 01:58:03,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:58:03,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 01:58:03,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:58:03,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:58:03,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:58:03,639 INFO L87 Difference]: Start difference. First operand 4121 states and 5514 transitions. Second operand 8 states. [2019-01-14 01:58:05,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:58:05,009 INFO L93 Difference]: Finished difference Result 9471 states and 12597 transitions. [2019-01-14 01:58:05,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 01:58:05,009 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-01-14 01:58:05,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:58:05,024 INFO L225 Difference]: With dead ends: 9471 [2019-01-14 01:58:05,024 INFO L226 Difference]: Without dead ends: 5026 [2019-01-14 01:58:05,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-01-14 01:58:05,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5026 states. [2019-01-14 01:58:05,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5026 to 4503. [2019-01-14 01:58:05,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4503 states. [2019-01-14 01:58:05,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 6012 transitions. [2019-01-14 01:58:05,187 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 6012 transitions. Word has length 82 [2019-01-14 01:58:05,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:58:05,188 INFO L480 AbstractCegarLoop]: Abstraction has 4503 states and 6012 transitions. [2019-01-14 01:58:05,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:58:05,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 6012 transitions. [2019-01-14 01:58:05,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-14 01:58:05,195 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:58:05,196 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:58:05,197 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:58:05,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:58:05,199 INFO L82 PathProgramCache]: Analyzing trace with hash -56372555, now seen corresponding path program 1 times [2019-01-14 01:58:05,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:58:05,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:58:05,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:58:05,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:58:05,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:58:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:58:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-14 01:58:05,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:58:05,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 01:58:05,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:58:05,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:58:05,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:58:05,684 INFO L87 Difference]: Start difference. First operand 4503 states and 6012 transitions. Second operand 8 states. [2019-01-14 01:58:06,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:58:06,951 INFO L93 Difference]: Finished difference Result 9414 states and 12498 transitions. [2019-01-14 01:58:06,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 01:58:06,952 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-01-14 01:58:06,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:58:06,967 INFO L225 Difference]: With dead ends: 9414 [2019-01-14 01:58:06,967 INFO L226 Difference]: Without dead ends: 5348 [2019-01-14 01:58:06,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-01-14 01:58:06,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5348 states. [2019-01-14 01:58:07,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5348 to 5008. [2019-01-14 01:58:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5008 states. [2019-01-14 01:58:07,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5008 states to 5008 states and 6613 transitions. [2019-01-14 01:58:07,151 INFO L78 Accepts]: Start accepts. Automaton has 5008 states and 6613 transitions. Word has length 82 [2019-01-14 01:58:07,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:58:07,151 INFO L480 AbstractCegarLoop]: Abstraction has 5008 states and 6613 transitions. [2019-01-14 01:58:07,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:58:07,152 INFO L276 IsEmpty]: Start isEmpty. Operand 5008 states and 6613 transitions. [2019-01-14 01:58:07,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 01:58:07,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:58:07,157 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:58:07,157 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:58:07,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:58:07,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1381975007, now seen corresponding path program 1 times [2019-01-14 01:58:07,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:58:07,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:58:07,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:58:07,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:58:07,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:58:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:58:07,496 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-01-14 01:58:07,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:58:07,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 01:58:07,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:58:07,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:58:07,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:58:07,497 INFO L87 Difference]: Start difference. First operand 5008 states and 6613 transitions. Second operand 9 states. [2019-01-14 01:58:08,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:58:08,518 INFO L93 Difference]: Finished difference Result 6109 states and 8006 transitions. [2019-01-14 01:58:08,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 01:58:08,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-01-14 01:58:08,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:58:08,545 INFO L225 Difference]: With dead ends: 6109 [2019-01-14 01:58:08,546 INFO L226 Difference]: Without dead ends: 3538 [2019-01-14 01:58:08,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-01-14 01:58:08,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3538 states. [2019-01-14 01:58:08,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3538 to 3359. [2019-01-14 01:58:08,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3359 states. [2019-01-14 01:58:08,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 3359 states and 4377 transitions. [2019-01-14 01:58:08,640 INFO L78 Accepts]: Start accepts. Automaton has 3359 states and 4377 transitions. Word has length 84 [2019-01-14 01:58:08,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:58:08,641 INFO L480 AbstractCegarLoop]: Abstraction has 3359 states and 4377 transitions. [2019-01-14 01:58:08,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:58:08,641 INFO L276 IsEmpty]: Start isEmpty. Operand 3359 states and 4377 transitions. [2019-01-14 01:58:08,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 01:58:08,643 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:58:08,643 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:58:08,644 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:58:08,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:58:08,644 INFO L82 PathProgramCache]: Analyzing trace with hash -205126895, now seen corresponding path program 1 times [2019-01-14 01:58:08,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:58:08,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:58:08,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:58:08,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:58:08,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:58:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:58:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-14 01:58:09,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:58:09,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 01:58:09,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:58:09,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:58:09,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:58:09,410 INFO L87 Difference]: Start difference. First operand 3359 states and 4377 transitions. Second operand 9 states. [2019-01-14 01:58:10,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:58:10,468 INFO L93 Difference]: Finished difference Result 4458 states and 5761 transitions. [2019-01-14 01:58:10,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 01:58:10,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-01-14 01:58:10,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:58:10,474 INFO L225 Difference]: With dead ends: 4458 [2019-01-14 01:58:10,474 INFO L226 Difference]: Without dead ends: 1987 [2019-01-14 01:58:10,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-01-14 01:58:10,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2019-01-14 01:58:10,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1877. [2019-01-14 01:58:10,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-01-14 01:58:10,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2402 transitions. [2019-01-14 01:58:10,533 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2402 transitions. Word has length 84 [2019-01-14 01:58:10,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:58:10,534 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 2402 transitions. [2019-01-14 01:58:10,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:58:10,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2402 transitions. [2019-01-14 01:58:10,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-14 01:58:10,540 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:58:10,541 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:58:10,543 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:58:10,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:58:10,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1356500467, now seen corresponding path program 1 times [2019-01-14 01:58:10,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:58:10,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:58:10,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:58:10,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:58:10,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:58:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 01:58:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 01:58:10,667 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 01:58:10,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 01:58:10 BoogieIcfgContainer [2019-01-14 01:58:10,721 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 01:58:10,721 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 01:58:10,721 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 01:58:10,721 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 01:58:10,724 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:57:35" (3/4) ... [2019-01-14 01:58:10,730 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 01:58:10,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 01:58:10,731 INFO L168 Benchmark]: Toolchain (without parser) took 37051.73 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 347.6 MB). Free memory was 951.4 MB in the beginning and 883.1 MB in the end (delta: 68.3 MB). Peak memory consumption was 415.9 MB. Max. memory is 11.5 GB. [2019-01-14 01:58:10,734 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:58:10,734 INFO L168 Benchmark]: CACSL2BoogieTranslator took 424.13 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.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 01:58:10,736 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.34 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 01:58:10,737 INFO L168 Benchmark]: Boogie Preprocessor took 107.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -148.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-14 01:58:10,739 INFO L168 Benchmark]: RCFGBuilder took 927.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2019-01-14 01:58:10,740 INFO L168 Benchmark]: TraceAbstraction took 35509.08 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 245.9 MB). Free memory was 1.1 GB in the beginning and 883.1 MB in the end (delta: 168.4 MB). Peak memory consumption was 414.3 MB. Max. memory is 11.5 GB. [2019-01-14 01:58:10,742 INFO L168 Benchmark]: Witness Printer took 9.33 ms. Allocated memory is still 1.4 GB. Free memory is still 883.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:58:10,749 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 424.13 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.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 69.34 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 107.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -148.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 927.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35509.08 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 245.9 MB). Free memory was 1.1 GB in the beginning and 883.1 MB in the end (delta: 168.4 MB). Peak memory consumption was 414.3 MB. Max. memory is 11.5 GB. * Witness Printer took 9.33 ms. Allocated memory is still 1.4 GB. Free memory is still 883.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 77. Possible FailurePath: [L105] unsigned int a, b, r; [L107] a = __VERIFIER_nondet_uint() [L108] b = __VERIFIER_nondet_uint() [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 [L40] COND TRUE a3 == (unsigned char)0 [L41] EXPR na - 1 [L41] na = na - 1 [L42] COND TRUE a2 == (unsigned char)0 [L43] EXPR na - 1 [L43] na = na - 1 [L44] COND TRUE a1 == (unsigned char)0 [L45] EXPR na - 1 [L45] na = na - 1 [L49] nb = (unsigned char)4 [L50] COND FALSE !(b3 == (unsigned char)0) [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND TRUE i == (unsigned char)0 [L65] EXPR partial_sum + a0 [L65] partial_sum = partial_sum + a0 [L66] COND FALSE !(i == (unsigned char)1) [L67] COND FALSE !(i == (unsigned char)2) [L68] COND FALSE !(i == (unsigned char)3) [L70] COND TRUE i < nb [L71] COND TRUE i == (unsigned char)0 [L71] EXPR partial_sum + b0 [L71] partial_sum = partial_sum + b0 [L72] COND FALSE !(i == (unsigned char)1) [L73] COND FALSE !(i == (unsigned char)2) [L74] COND FALSE !(i == (unsigned char)3) [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum [L81] COND FALSE !(i == (unsigned char)1) [L82] COND FALSE !(i == (unsigned char)2) [L83] COND FALSE !(i == (unsigned char)3) [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND FALSE !(i < na) [L70] COND TRUE i < nb [L71] COND FALSE !(i == (unsigned char)0) [L72] COND TRUE i == (unsigned char)1 [L72] EXPR partial_sum + b1 [L72] partial_sum = partial_sum + b1 [L73] COND FALSE !(i == (unsigned char)2) [L74] COND FALSE !(i == (unsigned char)3) [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 [L80] COND FALSE !(i == (unsigned char)0) [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum [L82] COND FALSE !(i == (unsigned char)2) [L83] COND FALSE !(i == (unsigned char)3) [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND FALSE !(i < na) [L70] COND TRUE i < nb [L71] COND FALSE !(i == (unsigned char)0) [L72] COND FALSE !(i == (unsigned char)1) [L73] COND TRUE i == (unsigned char)2 [L73] EXPR partial_sum + b2 [L73] partial_sum = partial_sum + b2 [L74] COND FALSE !(i == (unsigned char)3) [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 [L80] COND FALSE !(i == (unsigned char)0) [L81] COND FALSE !(i == (unsigned char)1) [L82] COND TRUE i == (unsigned char)2 [L82] r2 = (unsigned char)partial_sum [L83] COND FALSE !(i == (unsigned char)3) [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND FALSE !(i < na) [L70] COND TRUE i < nb [L71] COND FALSE !(i == (unsigned char)0) [L72] COND FALSE !(i == (unsigned char)1) [L73] COND FALSE !(i == (unsigned char)2) [L74] COND TRUE i == (unsigned char)3 [L74] EXPR partial_sum + b3 [L74] partial_sum = partial_sum + b3 [L76] COND FALSE !(partial_sum > ((unsigned char)254)) [L80] COND FALSE !(i == (unsigned char)0) [L81] COND FALSE !(i == (unsigned char)1) [L82] COND FALSE !(i == (unsigned char)2) [L83] COND TRUE i == (unsigned char)3 [L83] r3 = (unsigned char)partial_sum [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) [L88] COND FALSE !(i < (unsigned char)4) [L97] r1 << 8U [L97] r2 << 16U [L97] r3 << 24U - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 38 error locations. UNSAFE Result, 35.4s OverallTime, 21 OverallIterations, 4 TraceHistogramMax, 26.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2094 SDtfs, 4875 SDslu, 5085 SDs, 0 SdLazy, 6157 SolverSat, 551 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 21.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 379 GetRequests, 225 SyntacticMatches, 17 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5008occurred in iteration=18, 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: 1.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 3832 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 1360 NumberOfCodeBlocks, 1360 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1247 ConstructedInterpolants, 28 QuantifiedInterpolants, 280425 SizeOfPredicates, 6 NumberOfNonLiveVariables, 415 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 1201/1220 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...