./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 22:06:31,532 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 22:06:31,534 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 22:06:31,546 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 22:06:31,546 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 22:06:31,547 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 22:06:31,548 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 22:06:31,550 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 22:06:31,552 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 22:06:31,553 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 22:06:31,554 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 22:06:31,554 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 22:06:31,555 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 22:06:31,556 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 22:06:31,557 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 22:06:31,558 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 22:06:31,558 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 22:06:31,560 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 22:06:31,562 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 22:06:31,564 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 22:06:31,565 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 22:06:31,566 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 22:06:31,569 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 22:06:31,569 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 22:06:31,569 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 22:06:31,570 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 22:06:31,571 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 22:06:31,572 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 22:06:31,573 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 22:06:31,574 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 22:06:31,574 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 22:06:31,575 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 22:06:31,575 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 22:06:31,576 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 22:06:31,577 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 22:06:31,577 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 22:06:31,578 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-01-14 22:06:31,593 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 22:06:31,594 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 22:06:31,595 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 22:06:31,595 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 22:06:31,595 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 22:06:31,596 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 22:06:31,596 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 22:06:31,596 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 22:06:31,596 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 22:06:31,596 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 22:06:31,596 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 22:06:31,597 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 22:06:31,597 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 22:06:31,597 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 22:06:31,597 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 22:06:31,597 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 22:06:31,597 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 22:06:31,598 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 22:06:31,598 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 22:06:31,598 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 22:06:31,598 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 22:06:31,598 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 22:06:31,599 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 22:06:31,599 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 22:06:31,599 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 22:06:31,599 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 22:06:31,599 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 22:06:31,599 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 22:06:31,600 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 22:06:31,600 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 22:06:31,658 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 22:06:31,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 22:06:31,683 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 22:06:31,684 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 22:06:31,685 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 22:06:31,686 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/byte_add_false-no-overflow.i [2019-01-14 22:06:31,752 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54c007aa/e1cbe35c6a0b42b9bba287b775523ac3/FLAGd3a222735 [2019-01-14 22:06:32,199 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 22:06:32,200 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/byte_add_false-no-overflow.i [2019-01-14 22:06:32,208 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54c007aa/e1cbe35c6a0b42b9bba287b775523ac3/FLAGd3a222735 [2019-01-14 22:06:32,562 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54c007aa/e1cbe35c6a0b42b9bba287b775523ac3 [2019-01-14 22:06:32,566 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 22:06:32,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 22:06:32,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 22:06:32,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 22:06:32,573 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 22:06:32,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 10:06:32" (1/1) ... [2019-01-14 22:06:32,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5089c550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:06:32, skipping insertion in model container [2019-01-14 22:06:32,578 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 10:06:32" (1/1) ... [2019-01-14 22:06:32,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 22:06:32,612 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 22:06:32,826 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 22:06:32,830 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 22:06:32,896 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 22:06:32,910 INFO L195 MainTranslator]: Completed translation [2019-01-14 22:06:32,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:06:32 WrapperNode [2019-01-14 22:06:32,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 22:06:32,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 22:06:32,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 22:06:32,912 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 22:06:32,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:06:32" (1/1) ... [2019-01-14 22:06:32,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:06:32" (1/1) ... [2019-01-14 22:06:32,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 22:06:32,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 22:06:32,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 22:06:32,957 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 22:06:33,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:06:32" (1/1) ... [2019-01-14 22:06:33,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:06:32" (1/1) ... [2019-01-14 22:06:33,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:06:32" (1/1) ... [2019-01-14 22:06:33,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:06:32" (1/1) ... [2019-01-14 22:06:33,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:06:32" (1/1) ... [2019-01-14 22:06:33,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:06:32" (1/1) ... [2019-01-14 22:06:33,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:06:32" (1/1) ... [2019-01-14 22:06:33,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 22:06:33,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 22:06:33,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 22:06:33,083 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 22:06:33,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:06:32" (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 22:06:33,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 22:06:33,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 22:06:34,006 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 22:06:34,007 INFO L286 CfgBuilder]: Removed 10 assue(true) statements. [2019-01-14 22:06:34,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 10:06:34 BoogieIcfgContainer [2019-01-14 22:06:34,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 22:06:34,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 22:06:34,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 22:06:34,016 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 22:06:34,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 10:06:32" (1/3) ... [2019-01-14 22:06:34,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c903b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 10:06:34, skipping insertion in model container [2019-01-14 22:06:34,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:06:32" (2/3) ... [2019-01-14 22:06:34,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c903b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 10:06:34, skipping insertion in model container [2019-01-14 22:06:34,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 10:06:34" (3/3) ... [2019-01-14 22:06:34,025 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-no-overflow.i [2019-01-14 22:06:34,038 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 22:06:34,054 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2019-01-14 22:06:34,076 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2019-01-14 22:06:34,128 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 22:06:34,129 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 22:06:34,129 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 22:06:34,129 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 22:06:34,130 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 22:06:34,130 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 22:06:34,131 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 22:06:34,131 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 22:06:34,131 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 22:06:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-01-14 22:06:34,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-14 22:06:34,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:34,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-14 22:06:34,179 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:34,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:34,184 INFO L82 PathProgramCache]: Analyzing trace with hash 30881, now seen corresponding path program 1 times [2019-01-14 22:06:34,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:34,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:34,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:34,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:06:34,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:34,311 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 22:06:34,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 22:06:34,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 22:06:34,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 22:06:34,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 22:06:34,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 22:06:34,332 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-01-14 22:06:34,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:34,355 INFO L93 Difference]: Finished difference Result 134 states and 176 transitions. [2019-01-14 22:06:34,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 22:06:34,356 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 3 [2019-01-14 22:06:34,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:34,369 INFO L225 Difference]: With dead ends: 134 [2019-01-14 22:06:34,369 INFO L226 Difference]: Without dead ends: 68 [2019-01-14 22:06:34,373 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 22:06:34,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-14 22:06:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-14 22:06:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 22:06:34,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2019-01-14 22:06:34,415 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 3 [2019-01-14 22:06:34,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:34,416 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2019-01-14 22:06:34,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 22:06:34,416 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2019-01-14 22:06:34,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 22:06:34,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:34,418 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 22:06:34,419 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:34,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:34,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1126401592, now seen corresponding path program 1 times [2019-01-14 22:06:34,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:34,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:34,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:34,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:06:34,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:34,607 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 22:06:34,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 22:06:34,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 22:06:34,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 22:06:34,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 22:06:34,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 22:06:34,610 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand 3 states. [2019-01-14 22:06:35,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:35,024 INFO L93 Difference]: Finished difference Result 144 states and 211 transitions. [2019-01-14 22:06:35,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 22:06:35,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-14 22:06:35,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:35,027 INFO L225 Difference]: With dead ends: 144 [2019-01-14 22:06:35,027 INFO L226 Difference]: Without dead ends: 97 [2019-01-14 22:06:35,028 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 22:06:35,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-14 22:06:35,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-01-14 22:06:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 22:06:35,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 123 transitions. [2019-01-14 22:06:35,041 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 123 transitions. Word has length 12 [2019-01-14 22:06:35,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:35,041 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 123 transitions. [2019-01-14 22:06:35,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 22:06:35,042 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2019-01-14 22:06:35,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 22:06:35,043 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:35,043 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 22:06:35,044 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:35,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:35,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1247347973, now seen corresponding path program 1 times [2019-01-14 22:06:35,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:35,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:35,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:35,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:06:35,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:35,227 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 22:06:35,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 22:06:35,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 22:06:35,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 22:06:35,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 22:06:35,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 22:06:35,230 INFO L87 Difference]: Start difference. First operand 93 states and 123 transitions. Second operand 4 states. [2019-01-14 22:06:36,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:36,081 INFO L93 Difference]: Finished difference Result 213 states and 316 transitions. [2019-01-14 22:06:36,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 22:06:36,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-01-14 22:06:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:36,084 INFO L225 Difference]: With dead ends: 213 [2019-01-14 22:06:36,084 INFO L226 Difference]: Without dead ends: 166 [2019-01-14 22:06:36,085 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 22:06:36,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-14 22:06:36,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 118. [2019-01-14 22:06:36,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-14 22:06:36,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 160 transitions. [2019-01-14 22:06:36,098 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 160 transitions. Word has length 19 [2019-01-14 22:06:36,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:36,099 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 160 transitions. [2019-01-14 22:06:36,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 22:06:36,099 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 160 transitions. [2019-01-14 22:06:36,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 22:06:36,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:36,101 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 22:06:36,102 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:36,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:36,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1023692700, now seen corresponding path program 1 times [2019-01-14 22:06:36,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:36,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:36,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:36,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:06:36,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:36,278 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 22:06:36,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 22:06:36,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 22:06:36,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 22:06:36,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 22:06:36,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 22:06:36,280 INFO L87 Difference]: Start difference. First operand 118 states and 160 transitions. Second operand 4 states. [2019-01-14 22:06:36,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:36,683 INFO L93 Difference]: Finished difference Result 313 states and 446 transitions. [2019-01-14 22:06:36,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 22:06:36,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-01-14 22:06:36,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:36,686 INFO L225 Difference]: With dead ends: 313 [2019-01-14 22:06:36,686 INFO L226 Difference]: Without dead ends: 221 [2019-01-14 22:06:36,688 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 22:06:36,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-01-14 22:06:36,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 157. [2019-01-14 22:06:36,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-14 22:06:36,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 221 transitions. [2019-01-14 22:06:36,709 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 221 transitions. Word has length 26 [2019-01-14 22:06:36,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:36,709 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 221 transitions. [2019-01-14 22:06:36,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 22:06:36,709 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 221 transitions. [2019-01-14 22:06:36,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 22:06:36,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:36,712 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 22:06:36,713 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:36,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:36,713 INFO L82 PathProgramCache]: Analyzing trace with hash -421998743, now seen corresponding path program 1 times [2019-01-14 22:06:36,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:36,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:36,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:36,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:06:36,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:36,837 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 22:06:36,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 22:06:36,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 22:06:36,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 22:06:36,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 22:06:36,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 22:06:36,839 INFO L87 Difference]: Start difference. First operand 157 states and 221 transitions. Second operand 5 states. [2019-01-14 22:06:37,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:37,785 INFO L93 Difference]: Finished difference Result 454 states and 637 transitions. [2019-01-14 22:06:37,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 22:06:37,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-01-14 22:06:37,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:37,789 INFO L225 Difference]: With dead ends: 454 [2019-01-14 22:06:37,789 INFO L226 Difference]: Without dead ends: 321 [2019-01-14 22:06:37,790 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 22:06:37,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-01-14 22:06:37,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 170. [2019-01-14 22:06:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-01-14 22:06:37,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 237 transitions. [2019-01-14 22:06:37,823 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 237 transitions. Word has length 33 [2019-01-14 22:06:37,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:37,824 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 237 transitions. [2019-01-14 22:06:37,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 22:06:37,824 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 237 transitions. [2019-01-14 22:06:37,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 22:06:37,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:37,833 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 22:06:37,834 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:37,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:37,835 INFO L82 PathProgramCache]: Analyzing trace with hash 337056594, now seen corresponding path program 1 times [2019-01-14 22:06:37,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:37,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:37,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:37,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:06:37,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:38,134 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 22:06:38,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 22:06:38,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 22:06:38,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 22:06:38,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 22:06:38,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 22:06:38,135 INFO L87 Difference]: Start difference. First operand 170 states and 237 transitions. Second operand 5 states. [2019-01-14 22:06:38,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:38,629 INFO L93 Difference]: Finished difference Result 460 states and 643 transitions. [2019-01-14 22:06:38,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 22:06:38,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-01-14 22:06:38,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:38,634 INFO L225 Difference]: With dead ends: 460 [2019-01-14 22:06:38,635 INFO L226 Difference]: Without dead ends: 327 [2019-01-14 22:06:38,636 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 22:06:38,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-01-14 22:06:38,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 183. [2019-01-14 22:06:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-01-14 22:06:38,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 251 transitions. [2019-01-14 22:06:38,654 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 251 transitions. Word has length 36 [2019-01-14 22:06:38,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:38,655 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 251 transitions. [2019-01-14 22:06:38,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 22:06:38,655 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 251 transitions. [2019-01-14 22:06:38,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 22:06:38,657 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:38,657 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 22:06:38,659 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:38,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:38,659 INFO L82 PathProgramCache]: Analyzing trace with hash -466613948, now seen corresponding path program 1 times [2019-01-14 22:06:38,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:38,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:38,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:38,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:06:38,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:38,816 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 22:06:38,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:06:38,817 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 22:06:38,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:06:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:38,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:06:39,081 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 22:06:39,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 22:06:39,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-14 22:06:39,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 22:06:39,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 22:06:39,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 22:06:39,117 INFO L87 Difference]: Start difference. First operand 183 states and 251 transitions. Second operand 7 states. [2019-01-14 22:06:40,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:40,591 INFO L93 Difference]: Finished difference Result 420 states and 611 transitions. [2019-01-14 22:06:40,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 22:06:40,596 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-01-14 22:06:40,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:40,598 INFO L225 Difference]: With dead ends: 420 [2019-01-14 22:06:40,598 INFO L226 Difference]: Without dead ends: 285 [2019-01-14 22:06:40,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-14 22:06:40,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-01-14 22:06:40,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 229. [2019-01-14 22:06:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-14 22:06:40,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 289 transitions. [2019-01-14 22:06:40,614 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 289 transitions. Word has length 39 [2019-01-14 22:06:40,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:40,614 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 289 transitions. [2019-01-14 22:06:40,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 22:06:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 289 transitions. [2019-01-14 22:06:40,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-14 22:06:40,616 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:40,616 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 22:06:40,617 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:40,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:40,617 INFO L82 PathProgramCache]: Analyzing trace with hash -811417915, now seen corresponding path program 1 times [2019-01-14 22:06:40,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:40,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:40,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:40,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:06:40,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:40,708 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 22:06:40,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 22:06:40,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 22:06:40,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 22:06:40,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 22:06:40,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 22:06:40,709 INFO L87 Difference]: Start difference. First operand 229 states and 289 transitions. Second operand 3 states. [2019-01-14 22:06:40,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:40,764 INFO L93 Difference]: Finished difference Result 273 states and 338 transitions. [2019-01-14 22:06:40,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 22:06:40,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-01-14 22:06:40,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:40,766 INFO L225 Difference]: With dead ends: 273 [2019-01-14 22:06:40,766 INFO L226 Difference]: Without dead ends: 196 [2019-01-14 22:06:40,767 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 22:06:40,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-14 22:06:40,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-01-14 22:06:40,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-14 22:06:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 246 transitions. [2019-01-14 22:06:40,775 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 246 transitions. Word has length 46 [2019-01-14 22:06:40,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:40,775 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 246 transitions. [2019-01-14 22:06:40,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 22:06:40,775 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 246 transitions. [2019-01-14 22:06:40,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-14 22:06:40,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:40,777 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 22:06:40,778 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:40,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:40,779 INFO L82 PathProgramCache]: Analyzing trace with hash 669122321, now seen corresponding path program 1 times [2019-01-14 22:06:40,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:40,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:40,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:40,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:06:40,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:40,895 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 22:06:40,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 22:06:40,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 22:06:40,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 22:06:40,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 22:06:40,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 22:06:40,896 INFO L87 Difference]: Start difference. First operand 196 states and 246 transitions. Second operand 5 states. [2019-01-14 22:06:41,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:41,672 INFO L93 Difference]: Finished difference Result 552 states and 694 transitions. [2019-01-14 22:06:41,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 22:06:41,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-01-14 22:06:41,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:41,676 INFO L225 Difference]: With dead ends: 552 [2019-01-14 22:06:41,676 INFO L226 Difference]: Without dead ends: 406 [2019-01-14 22:06:41,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 22:06:41,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-01-14 22:06:41,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 247. [2019-01-14 22:06:41,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-14 22:06:41,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 310 transitions. [2019-01-14 22:06:41,691 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 310 transitions. Word has length 58 [2019-01-14 22:06:41,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:41,691 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 310 transitions. [2019-01-14 22:06:41,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 22:06:41,691 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 310 transitions. [2019-01-14 22:06:41,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-14 22:06:41,694 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:41,694 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 22:06:41,696 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:41,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:41,698 INFO L82 PathProgramCache]: Analyzing trace with hash 2018692145, now seen corresponding path program 1 times [2019-01-14 22:06:41,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:41,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:41,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:41,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:06:41,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:41,881 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 22:06:41,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 22:06:41,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 22:06:41,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 22:06:41,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 22:06:41,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 22:06:41,883 INFO L87 Difference]: Start difference. First operand 247 states and 310 transitions. Second operand 3 states. [2019-01-14 22:06:41,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:41,900 INFO L93 Difference]: Finished difference Result 260 states and 323 transitions. [2019-01-14 22:06:41,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 22:06:41,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-01-14 22:06:41,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:41,903 INFO L225 Difference]: With dead ends: 260 [2019-01-14 22:06:41,903 INFO L226 Difference]: Without dead ends: 247 [2019-01-14 22:06:41,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 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 22:06:41,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-14 22:06:41,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-01-14 22:06:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-14 22:06:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 309 transitions. [2019-01-14 22:06:41,915 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 309 transitions. Word has length 61 [2019-01-14 22:06:41,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:41,915 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 309 transitions. [2019-01-14 22:06:41,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 22:06:41,916 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 309 transitions. [2019-01-14 22:06:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-14 22:06:41,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:41,922 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 22:06:41,925 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:41,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:41,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1007574895, now seen corresponding path program 1 times [2019-01-14 22:06:41,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:41,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:41,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:41,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:06:41,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:42,061 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 22:06:42,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 22:06:42,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 22:06:42,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 22:06:42,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 22:06:42,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 22:06:42,063 INFO L87 Difference]: Start difference. First operand 247 states and 309 transitions. Second operand 4 states. [2019-01-14 22:06:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:42,499 INFO L93 Difference]: Finished difference Result 553 states and 688 transitions. [2019-01-14 22:06:42,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 22:06:42,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-01-14 22:06:42,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:42,505 INFO L225 Difference]: With dead ends: 553 [2019-01-14 22:06:42,505 INFO L226 Difference]: Without dead ends: 356 [2019-01-14 22:06:42,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 22:06:42,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-01-14 22:06:42,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 261. [2019-01-14 22:06:42,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-01-14 22:06:42,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 333 transitions. [2019-01-14 22:06:42,524 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 333 transitions. Word has length 61 [2019-01-14 22:06:42,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:42,526 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 333 transitions. [2019-01-14 22:06:42,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 22:06:42,526 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 333 transitions. [2019-01-14 22:06:42,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-14 22:06:42,530 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:42,530 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 22:06:42,531 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:42,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:42,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1454389477, now seen corresponding path program 1 times [2019-01-14 22:06:42,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:42,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:42,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:42,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:06:42,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:43,162 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-01-14 22:06:43,369 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 22:06:43,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 22:06:43,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 22:06:43,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 22:06:43,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 22:06:43,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 22:06:43,371 INFO L87 Difference]: Start difference. First operand 261 states and 333 transitions. Second operand 7 states. [2019-01-14 22:06:44,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:44,211 INFO L93 Difference]: Finished difference Result 772 states and 1003 transitions. [2019-01-14 22:06:44,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 22:06:44,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-01-14 22:06:44,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:44,218 INFO L225 Difference]: With dead ends: 772 [2019-01-14 22:06:44,219 INFO L226 Difference]: Without dead ends: 550 [2019-01-14 22:06:44,219 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 22:06:44,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-01-14 22:06:44,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 509. [2019-01-14 22:06:44,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-01-14 22:06:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 649 transitions. [2019-01-14 22:06:44,243 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 649 transitions. Word has length 67 [2019-01-14 22:06:44,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:44,243 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 649 transitions. [2019-01-14 22:06:44,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 22:06:44,243 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 649 transitions. [2019-01-14 22:06:44,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-14 22:06:44,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:44,244 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 22:06:44,247 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:44,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:44,249 INFO L82 PathProgramCache]: Analyzing trace with hash 2083812095, now seen corresponding path program 1 times [2019-01-14 22:06:44,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:44,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:44,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:44,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:06:44,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:44,445 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 22:06:44,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:06:44,446 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 22:06:44,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:06:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:44,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:06:44,604 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 22:06:44,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 22:06:44,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2019-01-14 22:06:44,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 22:06:44,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 22:06:44,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 22:06:44,624 INFO L87 Difference]: Start difference. First operand 509 states and 649 transitions. Second operand 7 states. [2019-01-14 22:06:47,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:47,168 INFO L93 Difference]: Finished difference Result 2680 states and 3314 transitions. [2019-01-14 22:06:47,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 22:06:47,170 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-01-14 22:06:47,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:47,195 INFO L225 Difference]: With dead ends: 2680 [2019-01-14 22:06:47,196 INFO L226 Difference]: Without dead ends: 2026 [2019-01-14 22:06:47,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-01-14 22:06:47,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2019-01-14 22:06:47,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 869. [2019-01-14 22:06:47,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-01-14 22:06:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1184 transitions. [2019-01-14 22:06:47,242 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1184 transitions. Word has length 67 [2019-01-14 22:06:47,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:47,242 INFO L480 AbstractCegarLoop]: Abstraction has 869 states and 1184 transitions. [2019-01-14 22:06:47,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 22:06:47,243 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1184 transitions. [2019-01-14 22:06:47,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-14 22:06:47,247 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:47,247 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 22:06:47,248 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:47,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:47,253 INFO L82 PathProgramCache]: Analyzing trace with hash 855628834, now seen corresponding path program 1 times [2019-01-14 22:06:47,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:47,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:47,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:47,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:06:47,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:47,546 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 22:06:47,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:06:47,547 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 22:06:47,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:06:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:47,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:06:48,677 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 22:06:48,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 22:06:48,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2019-01-14 22:06:48,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 22:06:48,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 22:06:48,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=31, Unknown=3, NotChecked=0, Total=56 [2019-01-14 22:06:48,698 INFO L87 Difference]: Start difference. First operand 869 states and 1184 transitions. Second operand 8 states. [2019-01-14 22:06:52,301 WARN L181 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 22:06:57,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:57,891 INFO L93 Difference]: Finished difference Result 2166 states and 2929 transitions. [2019-01-14 22:06:57,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 22:06:57,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2019-01-14 22:06:57,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:57,900 INFO L225 Difference]: With dead ends: 2166 [2019-01-14 22:06:57,901 INFO L226 Difference]: Without dead ends: 1262 [2019-01-14 22:06:57,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=45, Invalid=62, Unknown=3, NotChecked=0, Total=110 [2019-01-14 22:06:57,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2019-01-14 22:06:57,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1071. [2019-01-14 22:06:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1071 states. [2019-01-14 22:06:57,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1458 transitions. [2019-01-14 22:06:57,955 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1458 transitions. Word has length 73 [2019-01-14 22:06:57,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:57,955 INFO L480 AbstractCegarLoop]: Abstraction has 1071 states and 1458 transitions. [2019-01-14 22:06:57,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 22:06:57,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1458 transitions. [2019-01-14 22:06:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-14 22:06:57,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:57,960 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 22:06:57,961 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:57,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:57,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1090909143, now seen corresponding path program 1 times [2019-01-14 22:06:57,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:57,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:57,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:57,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:06:57,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:58,283 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 22:06:58,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 22:06:58,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 22:06:58,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 22:06:58,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 22:06:58,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 22:06:58,284 INFO L87 Difference]: Start difference. First operand 1071 states and 1458 transitions. Second operand 7 states. [2019-01-14 22:07:00,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:07:00,056 INFO L93 Difference]: Finished difference Result 3380 states and 4566 transitions. [2019-01-14 22:07:00,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 22:07:00,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-01-14 22:07:00,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:07:00,067 INFO L225 Difference]: With dead ends: 3380 [2019-01-14 22:07:00,067 INFO L226 Difference]: Without dead ends: 2160 [2019-01-14 22:07:00,070 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 22:07:00,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2019-01-14 22:07:00,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 1869. [2019-01-14 22:07:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1869 states. [2019-01-14 22:07:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2519 transitions. [2019-01-14 22:07:00,149 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2519 transitions. Word has length 79 [2019-01-14 22:07:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:07:00,149 INFO L480 AbstractCegarLoop]: Abstraction has 1869 states and 2519 transitions. [2019-01-14 22:07:00,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 22:07:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2519 transitions. [2019-01-14 22:07:00,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-14 22:07:00,153 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:07:00,153 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 22:07:00,154 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:07:00,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:07:00,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1286610050, now seen corresponding path program 1 times [2019-01-14 22:07:00,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:07:00,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:07:00,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:07:00,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:07:00,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:07:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:07:00,367 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 22:07:00,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 22:07:00,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 22:07:00,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 22:07:00,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 22:07:00,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 22:07:00,369 INFO L87 Difference]: Start difference. First operand 1869 states and 2519 transitions. Second operand 7 states. [2019-01-14 22:07:01,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:07:01,566 INFO L93 Difference]: Finished difference Result 6544 states and 8730 transitions. [2019-01-14 22:07:01,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 22:07:01,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-01-14 22:07:01,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:07:01,580 INFO L225 Difference]: With dead ends: 6544 [2019-01-14 22:07:01,580 INFO L226 Difference]: Without dead ends: 4400 [2019-01-14 22:07:01,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-01-14 22:07:01,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4400 states. [2019-01-14 22:07:01,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4400 to 4121. [2019-01-14 22:07:01,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4121 states. [2019-01-14 22:07:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4121 states to 4121 states and 5514 transitions. [2019-01-14 22:07:01,832 INFO L78 Accepts]: Start accepts. Automaton has 4121 states and 5514 transitions. Word has length 79 [2019-01-14 22:07:01,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:07:01,833 INFO L480 AbstractCegarLoop]: Abstraction has 4121 states and 5514 transitions. [2019-01-14 22:07:01,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 22:07:01,833 INFO L276 IsEmpty]: Start isEmpty. Operand 4121 states and 5514 transitions. [2019-01-14 22:07:01,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-14 22:07:01,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:07:01,838 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 22:07:01,838 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:07:01,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:07:01,839 INFO L82 PathProgramCache]: Analyzing trace with hash -2026749083, now seen corresponding path program 1 times [2019-01-14 22:07:01,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:07:01,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:07:01,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:07:01,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:07:01,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:07:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:07:02,114 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 22:07:02,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 22:07:02,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 22:07:02,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 22:07:02,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 22:07:02,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 22:07:02,115 INFO L87 Difference]: Start difference. First operand 4121 states and 5514 transitions. Second operand 8 states. [2019-01-14 22:07:03,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:07:03,489 INFO L93 Difference]: Finished difference Result 9471 states and 12597 transitions. [2019-01-14 22:07:03,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 22:07:03,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-01-14 22:07:03,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:07:03,506 INFO L225 Difference]: With dead ends: 9471 [2019-01-14 22:07:03,506 INFO L226 Difference]: Without dead ends: 5026 [2019-01-14 22:07:03,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-01-14 22:07:03,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5026 states. [2019-01-14 22:07:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5026 to 4503. [2019-01-14 22:07:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4503 states. [2019-01-14 22:07:03,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 6012 transitions. [2019-01-14 22:07:03,693 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 6012 transitions. Word has length 82 [2019-01-14 22:07:03,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:07:03,693 INFO L480 AbstractCegarLoop]: Abstraction has 4503 states and 6012 transitions. [2019-01-14 22:07:03,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 22:07:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 6012 transitions. [2019-01-14 22:07:03,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-14 22:07:03,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:07:03,700 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 22:07:03,702 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:07:03,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:07:03,702 INFO L82 PathProgramCache]: Analyzing trace with hash -56372555, now seen corresponding path program 1 times [2019-01-14 22:07:03,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:07:03,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:07:03,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:07:03,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:07:03,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:07:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:07:03,915 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 22:07:03,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 22:07:03,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 22:07:03,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 22:07:03,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 22:07:03,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 22:07:03,916 INFO L87 Difference]: Start difference. First operand 4503 states and 6012 transitions. Second operand 8 states. [2019-01-14 22:07:05,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:07:05,126 INFO L93 Difference]: Finished difference Result 9414 states and 12498 transitions. [2019-01-14 22:07:05,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 22:07:05,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-01-14 22:07:05,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:07:05,147 INFO L225 Difference]: With dead ends: 9414 [2019-01-14 22:07:05,182 INFO L226 Difference]: Without dead ends: 5348 [2019-01-14 22:07:05,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-01-14 22:07:05,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5348 states. [2019-01-14 22:07:05,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5348 to 5008. [2019-01-14 22:07:05,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5008 states. [2019-01-14 22:07:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5008 states to 5008 states and 6613 transitions. [2019-01-14 22:07:05,360 INFO L78 Accepts]: Start accepts. Automaton has 5008 states and 6613 transitions. Word has length 82 [2019-01-14 22:07:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:07:05,360 INFO L480 AbstractCegarLoop]: Abstraction has 5008 states and 6613 transitions. [2019-01-14 22:07:05,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 22:07:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 5008 states and 6613 transitions. [2019-01-14 22:07:05,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 22:07:05,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:07:05,367 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 22:07:05,368 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:07:05,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:07:05,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1381975007, now seen corresponding path program 1 times [2019-01-14 22:07:05,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:07:05,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:07:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:07:05,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:07:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:07:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:07:06,164 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 22:07:06,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 22:07:06,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 22:07:06,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 22:07:06,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 22:07:06,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-14 22:07:06,165 INFO L87 Difference]: Start difference. First operand 5008 states and 6613 transitions. Second operand 9 states. [2019-01-14 22:07:07,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:07:07,259 INFO L93 Difference]: Finished difference Result 6109 states and 8006 transitions. [2019-01-14 22:07:07,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 22:07:07,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-01-14 22:07:07,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:07:07,274 INFO L225 Difference]: With dead ends: 6109 [2019-01-14 22:07:07,274 INFO L226 Difference]: Without dead ends: 3538 [2019-01-14 22:07:07,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-01-14 22:07:07,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3538 states. [2019-01-14 22:07:07,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3538 to 3359. [2019-01-14 22:07:07,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3359 states. [2019-01-14 22:07:07,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 3359 states and 4377 transitions. [2019-01-14 22:07:07,379 INFO L78 Accepts]: Start accepts. Automaton has 3359 states and 4377 transitions. Word has length 84 [2019-01-14 22:07:07,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:07:07,380 INFO L480 AbstractCegarLoop]: Abstraction has 3359 states and 4377 transitions. [2019-01-14 22:07:07,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 22:07:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3359 states and 4377 transitions. [2019-01-14 22:07:07,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 22:07:07,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:07:07,384 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 22:07:07,384 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:07:07,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:07:07,385 INFO L82 PathProgramCache]: Analyzing trace with hash -205126895, now seen corresponding path program 1 times [2019-01-14 22:07:07,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:07:07,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:07:07,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:07:07,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:07:07,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:07:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:07:08,141 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 22:07:08,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 22:07:08,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 22:07:08,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 22:07:08,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 22:07:08,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-14 22:07:08,143 INFO L87 Difference]: Start difference. First operand 3359 states and 4377 transitions. Second operand 9 states. [2019-01-14 22:07:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:07:09,142 INFO L93 Difference]: Finished difference Result 4458 states and 5761 transitions. [2019-01-14 22:07:09,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 22:07:09,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-01-14 22:07:09,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:07:09,156 INFO L225 Difference]: With dead ends: 4458 [2019-01-14 22:07:09,156 INFO L226 Difference]: Without dead ends: 1987 [2019-01-14 22:07:09,160 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 22:07:09,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2019-01-14 22:07:09,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1877. [2019-01-14 22:07:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-01-14 22:07:09,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2402 transitions. [2019-01-14 22:07:09,223 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2402 transitions. Word has length 84 [2019-01-14 22:07:09,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:07:09,224 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 2402 transitions. [2019-01-14 22:07:09,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 22:07:09,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2402 transitions. [2019-01-14 22:07:09,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-14 22:07:09,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:07:09,228 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 22:07:09,228 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:07:09,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:07:09,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1356500467, now seen corresponding path program 1 times [2019-01-14 22:07:09,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:07:09,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:07:09,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:07:09,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:07:09,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:07:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 22:07:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 22:07:09,346 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 22:07:09,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 10:07:09 BoogieIcfgContainer [2019-01-14 22:07:09,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 22:07:09,416 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 22:07:09,416 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 22:07:09,416 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 22:07:09,419 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 10:06:34" (3/4) ... [2019-01-14 22:07:09,425 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 22:07:09,429 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 22:07:09,430 INFO L168 Benchmark]: Toolchain (without parser) took 36863.32 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 355.5 MB). Free memory was 952.7 MB in the beginning and 866.1 MB in the end (delta: 86.6 MB). Peak memory consumption was 442.0 MB. Max. memory is 11.5 GB. [2019-01-14 22:07:09,435 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 22:07:09,435 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.78 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 22:07:09,436 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.50 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 22:07:09,438 INFO L168 Benchmark]: Boogie Preprocessor took 125.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 22:07:09,439 INFO L168 Benchmark]: RCFGBuilder took 926.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. [2019-01-14 22:07:09,442 INFO L168 Benchmark]: TraceAbstraction took 35404.23 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.9 MB). Free memory was 1.1 GB in the beginning and 866.1 MB in the end (delta: 219.9 MB). Peak memory consumption was 443.7 MB. Max. memory is 11.5 GB. [2019-01-14 22:07:09,445 INFO L168 Benchmark]: Witness Printer took 13.03 ms. Allocated memory is still 1.4 GB. Free memory is still 866.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 22:07:09,456 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 341.78 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.50 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 125.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 926.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35404.23 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.9 MB). Free memory was 1.1 GB in the beginning and 866.1 MB in the end (delta: 219.9 MB). Peak memory consumption was 443.7 MB. Max. memory is 11.5 GB. * Witness Printer took 13.03 ms. Allocated memory is still 1.4 GB. Free memory is still 866.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.2s OverallTime, 21 OverallIterations, 4 TraceHistogramMax, 26.4s 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.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 379 GetRequests, 225 SyntacticMatches, 17 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 7.5s 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.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 3832 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.4s 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...