./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 2e94e6aa 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-2e94e6a [2019-01-01 21:14:51,905 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:14:51,907 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:14:51,919 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:14:51,920 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:14:51,921 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:14:51,922 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:14:51,924 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:14:51,926 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:14:51,927 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:14:51,928 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:14:51,928 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:14:51,929 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:14:51,930 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:14:51,932 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:14:51,933 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:14:51,935 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:14:51,939 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:14:51,946 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:14:51,948 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:14:51,950 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:14:51,951 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:14:51,954 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:14:51,955 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:14:51,958 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:14:51,959 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:14:51,960 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:14:51,961 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:14:51,962 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:14:51,967 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:14:51,968 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:14:51,968 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:14:51,968 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:14:51,969 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:14:51,969 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:14:51,972 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:14:51,972 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-01-01 21:14:52,002 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:14:52,005 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:14:52,006 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:14:52,007 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:14:52,007 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:14:52,007 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:14:52,007 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 21:14:52,007 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:14:52,009 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:14:52,009 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 21:14:52,010 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:14:52,010 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 21:14:52,010 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 21:14:52,010 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 21:14:52,010 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 21:14:52,011 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 21:14:52,011 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:14:52,011 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:14:52,011 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 21:14:52,011 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:14:52,011 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:14:52,012 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 21:14:52,012 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 21:14:52,012 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 21:14:52,012 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:14:52,012 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 21:14:52,012 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 21:14:52,014 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:14:52,014 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 21:14:52,014 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 21:14:52,015 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-01 21:14:52,071 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:14:52,090 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:14:52,098 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:14:52,099 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:14:52,100 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:14:52,101 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/byte_add_false-no-overflow.i [2019-01-01 21:14:52,169 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf5574390/54df75b0539e43eeb9c13eb270fda749/FLAG3a2869e2a [2019-01-01 21:14:52,690 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:14:52,692 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/byte_add_false-no-overflow.i [2019-01-01 21:14:52,700 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf5574390/54df75b0539e43eeb9c13eb270fda749/FLAG3a2869e2a [2019-01-01 21:14:53,023 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf5574390/54df75b0539e43eeb9c13eb270fda749 [2019-01-01 21:14:53,027 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:14:53,029 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:14:53,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:14:53,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:14:53,034 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:14:53,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:14:53" (1/1) ... [2019-01-01 21:14:53,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3026fc79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:14:53, skipping insertion in model container [2019-01-01 21:14:53,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:14:53" (1/1) ... [2019-01-01 21:14:53,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:14:53,075 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:14:53,384 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:14:53,391 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:14:53,459 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:14:53,479 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:14:53,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:14:53 WrapperNode [2019-01-01 21:14:53,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:14:53,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:14:53,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:14:53,481 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:14:53,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:14:53" (1/1) ... [2019-01-01 21:14:53,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:14:53" (1/1) ... [2019-01-01 21:14:53,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:14:53,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:14:53,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:14:53,539 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:14:53,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:14:53" (1/1) ... [2019-01-01 21:14:53,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:14:53" (1/1) ... [2019-01-01 21:14:53,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:14:53" (1/1) ... [2019-01-01 21:14:53,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:14:53" (1/1) ... [2019-01-01 21:14:53,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:14:53" (1/1) ... [2019-01-01 21:14:53,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:14:53" (1/1) ... [2019-01-01 21:14:53,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:14:53" (1/1) ... [2019-01-01 21:14:53,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:14:53,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:14:53,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:14:53,667 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:14:53,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:14:53" (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-01 21:14:53,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:14:53,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:14:54,587 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:14:54,587 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2019-01-01 21:14:54,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:14:54 BoogieIcfgContainer [2019-01-01 21:14:54,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:14:54,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 21:14:54,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 21:14:54,594 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 21:14:54,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 09:14:53" (1/3) ... [2019-01-01 21:14:54,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230f8d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 09:14:54, skipping insertion in model container [2019-01-01 21:14:54,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:14:53" (2/3) ... [2019-01-01 21:14:54,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230f8d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 09:14:54, skipping insertion in model container [2019-01-01 21:14:54,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:14:54" (3/3) ... [2019-01-01 21:14:54,598 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-no-overflow.i [2019-01-01 21:14:54,609 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 21:14:54,618 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2019-01-01 21:14:54,637 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2019-01-01 21:14:54,673 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:14:54,674 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 21:14:54,674 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 21:14:54,675 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 21:14:54,675 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:14:54,675 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:14:54,675 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 21:14:54,676 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:14:54,676 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 21:14:54,705 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-01-01 21:14:54,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-01 21:14:54,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:54,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-01 21:14:54,719 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:54,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:54,726 INFO L82 PathProgramCache]: Analyzing trace with hash 30881, now seen corresponding path program 1 times [2019-01-01 21:14:54,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:54,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:54,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:54,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:14:54,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:54,866 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-01 21:14:54,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:14:54,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 21:14:54,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-01 21:14:54,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 21:14:54,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 21:14:54,893 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-01-01 21:14:54,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:54,916 INFO L93 Difference]: Finished difference Result 134 states and 176 transitions. [2019-01-01 21:14:54,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:14:54,918 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 3 [2019-01-01 21:14:54,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:54,929 INFO L225 Difference]: With dead ends: 134 [2019-01-01 21:14:54,929 INFO L226 Difference]: Without dead ends: 68 [2019-01-01 21:14:54,933 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-01 21:14:54,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-01 21:14:54,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-01 21:14:54,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-01 21:14:54,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2019-01-01 21:14:54,976 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 3 [2019-01-01 21:14:54,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:54,976 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2019-01-01 21:14:54,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-01 21:14:54,977 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2019-01-01 21:14:54,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 21:14:54,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:54,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:14:54,980 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:54,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:54,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1126401592, now seen corresponding path program 1 times [2019-01-01 21:14:54,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:54,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:54,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:54,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:14:54,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:55,167 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-01 21:14:55,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:14:55,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:14:55,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 21:14:55,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:14:55,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:14:55,171 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand 3 states. [2019-01-01 21:14:55,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:55,594 INFO L93 Difference]: Finished difference Result 144 states and 211 transitions. [2019-01-01 21:14:55,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:14:55,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-01 21:14:55,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:55,598 INFO L225 Difference]: With dead ends: 144 [2019-01-01 21:14:55,599 INFO L226 Difference]: Without dead ends: 97 [2019-01-01 21:14:55,600 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-01 21:14:55,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-01 21:14:55,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-01-01 21:14:55,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-01 21:14:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 123 transitions. [2019-01-01 21:14:55,622 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 123 transitions. Word has length 12 [2019-01-01 21:14:55,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:55,623 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 123 transitions. [2019-01-01 21:14:55,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 21:14:55,624 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2019-01-01 21:14:55,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 21:14:55,626 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:55,626 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-01 21:14:55,628 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:55,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:55,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1247347973, now seen corresponding path program 1 times [2019-01-01 21:14:55,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:55,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:55,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:55,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:14:55,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:55,770 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-01 21:14:55,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:14:55,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:14:55,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 21:14:55,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:14:55,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:14:55,772 INFO L87 Difference]: Start difference. First operand 93 states and 123 transitions. Second operand 4 states. [2019-01-01 21:14:56,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:56,593 INFO L93 Difference]: Finished difference Result 213 states and 316 transitions. [2019-01-01 21:14:56,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:14:56,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-01-01 21:14:56,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:56,598 INFO L225 Difference]: With dead ends: 213 [2019-01-01 21:14:56,598 INFO L226 Difference]: Without dead ends: 166 [2019-01-01 21:14:56,599 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-01 21:14:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-01 21:14:56,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 118. [2019-01-01 21:14:56,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-01 21:14:56,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 160 transitions. [2019-01-01 21:14:56,616 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 160 transitions. Word has length 19 [2019-01-01 21:14:56,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:56,617 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 160 transitions. [2019-01-01 21:14:56,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 21:14:56,617 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 160 transitions. [2019-01-01 21:14:56,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 21:14:56,622 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:56,623 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-01 21:14:56,624 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:56,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:56,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1023692700, now seen corresponding path program 1 times [2019-01-01 21:14:56,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:56,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:56,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:56,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:14:56,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:56,874 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-01 21:14:56,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:14:56,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:14:56,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 21:14:56,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:14:56,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:14:56,876 INFO L87 Difference]: Start difference. First operand 118 states and 160 transitions. Second operand 4 states. [2019-01-01 21:14:57,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:57,343 INFO L93 Difference]: Finished difference Result 313 states and 446 transitions. [2019-01-01 21:14:57,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:14:57,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-01-01 21:14:57,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:57,348 INFO L225 Difference]: With dead ends: 313 [2019-01-01 21:14:57,348 INFO L226 Difference]: Without dead ends: 221 [2019-01-01 21:14:57,349 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-01 21:14:57,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-01-01 21:14:57,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 157. [2019-01-01 21:14:57,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-01 21:14:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 221 transitions. [2019-01-01 21:14:57,372 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 221 transitions. Word has length 26 [2019-01-01 21:14:57,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:57,373 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 221 transitions. [2019-01-01 21:14:57,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 21:14:57,373 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 221 transitions. [2019-01-01 21:14:57,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-01 21:14:57,376 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:57,377 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-01 21:14:57,378 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:57,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:57,378 INFO L82 PathProgramCache]: Analyzing trace with hash -421998743, now seen corresponding path program 1 times [2019-01-01 21:14:57,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:57,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:57,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:57,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:14:57,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:57,539 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-01 21:14:57,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:14:57,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:14:57,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 21:14:57,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:14:57,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:14:57,540 INFO L87 Difference]: Start difference. First operand 157 states and 221 transitions. Second operand 5 states. [2019-01-01 21:14:58,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:58,315 INFO L93 Difference]: Finished difference Result 454 states and 637 transitions. [2019-01-01 21:14:58,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:14:58,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-01-01 21:14:58,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:58,319 INFO L225 Difference]: With dead ends: 454 [2019-01-01 21:14:58,319 INFO L226 Difference]: Without dead ends: 321 [2019-01-01 21:14:58,320 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-01 21:14:58,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-01-01 21:14:58,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 170. [2019-01-01 21:14:58,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-01-01 21:14:58,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 237 transitions. [2019-01-01 21:14:58,336 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 237 transitions. Word has length 33 [2019-01-01 21:14:58,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:58,336 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 237 transitions. [2019-01-01 21:14:58,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 21:14:58,337 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 237 transitions. [2019-01-01 21:14:58,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-01 21:14:58,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:58,340 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-01 21:14:58,341 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:58,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:58,342 INFO L82 PathProgramCache]: Analyzing trace with hash 337056594, now seen corresponding path program 1 times [2019-01-01 21:14:58,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:58,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:58,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:58,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:14:58,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:58,456 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-01 21:14:58,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:14:58,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 21:14:58,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 21:14:58,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:14:58,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:14:58,459 INFO L87 Difference]: Start difference. First operand 170 states and 237 transitions. Second operand 5 states. [2019-01-01 21:14:58,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:14:58,937 INFO L93 Difference]: Finished difference Result 460 states and 643 transitions. [2019-01-01 21:14:58,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:14:58,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-01-01 21:14:58,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:14:58,941 INFO L225 Difference]: With dead ends: 460 [2019-01-01 21:14:58,941 INFO L226 Difference]: Without dead ends: 327 [2019-01-01 21:14:58,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-01 21:14:58,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-01-01 21:14:58,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 183. [2019-01-01 21:14:58,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-01-01 21:14:58,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 251 transitions. [2019-01-01 21:14:58,956 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 251 transitions. Word has length 36 [2019-01-01 21:14:58,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:14:58,956 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 251 transitions. [2019-01-01 21:14:58,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 21:14:58,956 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 251 transitions. [2019-01-01 21:14:58,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-01 21:14:58,959 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:14:58,959 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-01 21:14:58,961 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:14:58,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:14:58,962 INFO L82 PathProgramCache]: Analyzing trace with hash -466613948, now seen corresponding path program 1 times [2019-01-01 21:14:58,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:14:58,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:14:58,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:58,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:14:58,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:14:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:59,092 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-01 21:14:59,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:14:59,093 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-01 21:14:59,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:14:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:14:59,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:14:59,247 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-01 21:14:59,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 21:14:59,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-01 21:14:59,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 21:14:59,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:14:59,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:14:59,269 INFO L87 Difference]: Start difference. First operand 183 states and 251 transitions. Second operand 7 states. [2019-01-01 21:15:00,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:00,727 INFO L93 Difference]: Finished difference Result 420 states and 611 transitions. [2019-01-01 21:15:00,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 21:15:00,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-01-01 21:15:00,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:00,732 INFO L225 Difference]: With dead ends: 420 [2019-01-01 21:15:00,732 INFO L226 Difference]: Without dead ends: 285 [2019-01-01 21:15:00,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-01 21:15:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-01-01 21:15:00,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 229. [2019-01-01 21:15:00,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-01 21:15:00,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 289 transitions. [2019-01-01 21:15:00,745 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 289 transitions. Word has length 39 [2019-01-01 21:15:00,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:00,745 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 289 transitions. [2019-01-01 21:15:00,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 21:15:00,745 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 289 transitions. [2019-01-01 21:15:00,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-01 21:15:00,749 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:00,749 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-01 21:15:00,750 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:00,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:00,750 INFO L82 PathProgramCache]: Analyzing trace with hash -811417915, now seen corresponding path program 1 times [2019-01-01 21:15:00,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:00,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:00,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:00,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:00,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:00,840 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-01 21:15:00,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:15:00,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:15:00,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 21:15:00,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:15:00,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:15:00,842 INFO L87 Difference]: Start difference. First operand 229 states and 289 transitions. Second operand 3 states. [2019-01-01 21:15:00,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:00,884 INFO L93 Difference]: Finished difference Result 273 states and 338 transitions. [2019-01-01 21:15:00,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:15:00,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-01-01 21:15:00,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:00,886 INFO L225 Difference]: With dead ends: 273 [2019-01-01 21:15:00,886 INFO L226 Difference]: Without dead ends: 196 [2019-01-01 21:15:00,887 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-01 21:15:00,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-01 21:15:00,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-01-01 21:15:00,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-01 21:15:00,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 246 transitions. [2019-01-01 21:15:00,896 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 246 transitions. Word has length 46 [2019-01-01 21:15:00,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:00,897 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 246 transitions. [2019-01-01 21:15:00,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 21:15:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 246 transitions. [2019-01-01 21:15:00,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-01 21:15:00,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:00,900 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-01 21:15:00,902 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:00,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:00,902 INFO L82 PathProgramCache]: Analyzing trace with hash 669122321, now seen corresponding path program 1 times [2019-01-01 21:15:00,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:00,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:00,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:00,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:00,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:01,075 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-01 21:15:01,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:15:01,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 21:15:01,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 21:15:01,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:15:01,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:15:01,077 INFO L87 Difference]: Start difference. First operand 196 states and 246 transitions. Second operand 5 states. [2019-01-01 21:15:01,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:01,886 INFO L93 Difference]: Finished difference Result 552 states and 694 transitions. [2019-01-01 21:15:01,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 21:15:01,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-01-01 21:15:01,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:01,892 INFO L225 Difference]: With dead ends: 552 [2019-01-01 21:15:01,892 INFO L226 Difference]: Without dead ends: 406 [2019-01-01 21:15:01,892 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-01 21:15:01,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-01-01 21:15:01,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 247. [2019-01-01 21:15:01,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-01 21:15:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 310 transitions. [2019-01-01 21:15:01,905 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 310 transitions. Word has length 58 [2019-01-01 21:15:01,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:01,906 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 310 transitions. [2019-01-01 21:15:01,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 21:15:01,906 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 310 transitions. [2019-01-01 21:15:01,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-01 21:15:01,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:01,907 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-01 21:15:01,908 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:01,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:01,911 INFO L82 PathProgramCache]: Analyzing trace with hash 2018692145, now seen corresponding path program 1 times [2019-01-01 21:15:01,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:01,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:01,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:01,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:01,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:02,050 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-01 21:15:02,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:15:02,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:15:02,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 21:15:02,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:15:02,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:15:02,051 INFO L87 Difference]: Start difference. First operand 247 states and 310 transitions. Second operand 3 states. [2019-01-01 21:15:02,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:02,067 INFO L93 Difference]: Finished difference Result 260 states and 323 transitions. [2019-01-01 21:15:02,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:15:02,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-01-01 21:15:02,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:02,072 INFO L225 Difference]: With dead ends: 260 [2019-01-01 21:15:02,073 INFO L226 Difference]: Without dead ends: 247 [2019-01-01 21:15:02,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:15:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-01 21:15:02,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-01-01 21:15:02,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-01 21:15:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 309 transitions. [2019-01-01 21:15:02,083 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 309 transitions. Word has length 61 [2019-01-01 21:15:02,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:02,083 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 309 transitions. [2019-01-01 21:15:02,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 21:15:02,085 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 309 transitions. [2019-01-01 21:15:02,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-01 21:15:02,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:02,086 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-01 21:15:02,089 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:02,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:02,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1007574895, now seen corresponding path program 1 times [2019-01-01 21:15:02,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:02,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:02,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:02,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:02,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:02,196 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-01 21:15:02,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:15:02,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:15:02,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 21:15:02,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:15:02,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:15:02,198 INFO L87 Difference]: Start difference. First operand 247 states and 309 transitions. Second operand 4 states. [2019-01-01 21:15:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:02,970 INFO L93 Difference]: Finished difference Result 553 states and 688 transitions. [2019-01-01 21:15:02,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:15:02,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-01-01 21:15:02,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:02,973 INFO L225 Difference]: With dead ends: 553 [2019-01-01 21:15:02,973 INFO L226 Difference]: Without dead ends: 356 [2019-01-01 21:15:02,974 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-01 21:15:02,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-01-01 21:15:02,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 261. [2019-01-01 21:15:02,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-01-01 21:15:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 333 transitions. [2019-01-01 21:15:02,986 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 333 transitions. Word has length 61 [2019-01-01 21:15:02,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:02,987 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 333 transitions. [2019-01-01 21:15:02,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 21:15:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 333 transitions. [2019-01-01 21:15:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-01 21:15:02,988 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:02,988 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-01 21:15:02,992 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:02,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:02,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1454389477, now seen corresponding path program 1 times [2019-01-01 21:15:02,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:02,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:02,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:02,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:02,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:03,638 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-01-01 21:15:03,836 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-01 21:15:03,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:15:03,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 21:15:03,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 21:15:03,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:15:03,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:15:03,837 INFO L87 Difference]: Start difference. First operand 261 states and 333 transitions. Second operand 7 states. [2019-01-01 21:15:04,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:04,701 INFO L93 Difference]: Finished difference Result 772 states and 1003 transitions. [2019-01-01 21:15:04,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 21:15:04,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-01-01 21:15:04,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:04,707 INFO L225 Difference]: With dead ends: 772 [2019-01-01 21:15:04,707 INFO L226 Difference]: Without dead ends: 550 [2019-01-01 21:15:04,709 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-01 21:15:04,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-01-01 21:15:04,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 509. [2019-01-01 21:15:04,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-01-01 21:15:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 649 transitions. [2019-01-01 21:15:04,731 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 649 transitions. Word has length 67 [2019-01-01 21:15:04,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:04,731 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 649 transitions. [2019-01-01 21:15:04,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 21:15:04,731 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 649 transitions. [2019-01-01 21:15:04,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-01 21:15:04,734 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:04,734 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-01 21:15:04,735 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:04,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:04,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2083812095, now seen corresponding path program 1 times [2019-01-01 21:15:04,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:04,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:04,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:04,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:04,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:05,271 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-01 21:15:05,279 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-01 21:15:05,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:15:05,280 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-01 21:15:05,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:05,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:15:05,674 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-01 21:15:05,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 21:15:05,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2019-01-01 21:15:05,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 21:15:05,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:15:05,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:15:05,708 INFO L87 Difference]: Start difference. First operand 509 states and 649 transitions. Second operand 7 states. [2019-01-01 21:15:08,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:08,067 INFO L93 Difference]: Finished difference Result 2680 states and 3314 transitions. [2019-01-01 21:15:08,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 21:15:08,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-01-01 21:15:08,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:08,077 INFO L225 Difference]: With dead ends: 2680 [2019-01-01 21:15:08,077 INFO L226 Difference]: Without dead ends: 2026 [2019-01-01 21:15:08,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-01-01 21:15:08,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2019-01-01 21:15:08,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 869. [2019-01-01 21:15:08,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-01-01 21:15:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1184 transitions. [2019-01-01 21:15:08,123 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1184 transitions. Word has length 67 [2019-01-01 21:15:08,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:08,124 INFO L480 AbstractCegarLoop]: Abstraction has 869 states and 1184 transitions. [2019-01-01 21:15:08,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 21:15:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1184 transitions. [2019-01-01 21:15:08,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-01 21:15:08,127 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:08,127 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-01 21:15:08,129 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:08,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:08,129 INFO L82 PathProgramCache]: Analyzing trace with hash 855628834, now seen corresponding path program 1 times [2019-01-01 21:15:08,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:08,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:08,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:08,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:08,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:08,393 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-01 21:15:08,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:15:08,394 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-01 21:15:08,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:08,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:15:09,528 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-01 21:15:09,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 21:15:09,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2019-01-01 21:15:09,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 21:15:09,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 21:15:09,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=31, Unknown=3, NotChecked=0, Total=56 [2019-01-01 21:15:09,557 INFO L87 Difference]: Start difference. First operand 869 states and 1184 transitions. Second operand 8 states. [2019-01-01 21:15:13,408 WARN L181 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 21:15:19,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:19,523 INFO L93 Difference]: Finished difference Result 2166 states and 2929 transitions. [2019-01-01 21:15:19,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 21:15:19,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2019-01-01 21:15:19,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:19,532 INFO L225 Difference]: With dead ends: 2166 [2019-01-01 21:15:19,532 INFO L226 Difference]: Without dead ends: 1262 [2019-01-01 21:15:19,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=45, Invalid=62, Unknown=3, NotChecked=0, Total=110 [2019-01-01 21:15:19,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2019-01-01 21:15:19,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1071. [2019-01-01 21:15:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1071 states. [2019-01-01 21:15:19,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1458 transitions. [2019-01-01 21:15:19,584 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1458 transitions. Word has length 73 [2019-01-01 21:15:19,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:19,584 INFO L480 AbstractCegarLoop]: Abstraction has 1071 states and 1458 transitions. [2019-01-01 21:15:19,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 21:15:19,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1458 transitions. [2019-01-01 21:15:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-01 21:15:19,588 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:19,588 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-01 21:15:19,589 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:19,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:19,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1090909143, now seen corresponding path program 1 times [2019-01-01 21:15:19,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:19,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:19,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:19,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:19,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:19,931 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-01 21:15:19,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:15:19,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 21:15:19,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 21:15:19,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:15:19,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:15:19,933 INFO L87 Difference]: Start difference. First operand 1071 states and 1458 transitions. Second operand 7 states. [2019-01-01 21:15:21,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:21,702 INFO L93 Difference]: Finished difference Result 3380 states and 4566 transitions. [2019-01-01 21:15:21,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 21:15:21,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-01-01 21:15:21,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:21,716 INFO L225 Difference]: With dead ends: 3380 [2019-01-01 21:15:21,717 INFO L226 Difference]: Without dead ends: 2160 [2019-01-01 21:15:21,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-01 21:15:21,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2019-01-01 21:15:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 1869. [2019-01-01 21:15:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1869 states. [2019-01-01 21:15:21,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2519 transitions. [2019-01-01 21:15:21,802 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2519 transitions. Word has length 79 [2019-01-01 21:15:21,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:21,802 INFO L480 AbstractCegarLoop]: Abstraction has 1869 states and 2519 transitions. [2019-01-01 21:15:21,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 21:15:21,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2519 transitions. [2019-01-01 21:15:21,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-01 21:15:21,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:21,807 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-01 21:15:21,808 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:21,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:21,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1286610050, now seen corresponding path program 1 times [2019-01-01 21:15:21,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:21,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:21,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:21,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:21,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:22,033 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-01 21:15:22,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:15:22,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 21:15:22,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 21:15:22,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:15:22,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:15:22,035 INFO L87 Difference]: Start difference. First operand 1869 states and 2519 transitions. Second operand 7 states. [2019-01-01 21:15:23,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:23,237 INFO L93 Difference]: Finished difference Result 6544 states and 8730 transitions. [2019-01-01 21:15:23,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 21:15:23,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-01-01 21:15:23,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:23,256 INFO L225 Difference]: With dead ends: 6544 [2019-01-01 21:15:23,257 INFO L226 Difference]: Without dead ends: 4400 [2019-01-01 21:15:23,263 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-01 21:15:23,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4400 states. [2019-01-01 21:15:23,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4400 to 4121. [2019-01-01 21:15:23,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4121 states. [2019-01-01 21:15:23,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4121 states to 4121 states and 5514 transitions. [2019-01-01 21:15:23,467 INFO L78 Accepts]: Start accepts. Automaton has 4121 states and 5514 transitions. Word has length 79 [2019-01-01 21:15:23,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:23,468 INFO L480 AbstractCegarLoop]: Abstraction has 4121 states and 5514 transitions. [2019-01-01 21:15:23,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 21:15:23,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4121 states and 5514 transitions. [2019-01-01 21:15:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-01 21:15:23,473 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:23,474 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-01 21:15:23,474 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:23,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:23,475 INFO L82 PathProgramCache]: Analyzing trace with hash -2026749083, now seen corresponding path program 1 times [2019-01-01 21:15:23,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:23,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:23,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:23,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:23,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:24,204 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-01 21:15:24,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:15:24,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 21:15:24,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 21:15:24,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 21:15:24,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 21:15:24,205 INFO L87 Difference]: Start difference. First operand 4121 states and 5514 transitions. Second operand 8 states. [2019-01-01 21:15:25,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:25,487 INFO L93 Difference]: Finished difference Result 9471 states and 12597 transitions. [2019-01-01 21:15:25,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 21:15:25,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-01-01 21:15:25,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:25,506 INFO L225 Difference]: With dead ends: 9471 [2019-01-01 21:15:25,506 INFO L226 Difference]: Without dead ends: 5026 [2019-01-01 21:15:25,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-01-01 21:15:25,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5026 states. [2019-01-01 21:15:25,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5026 to 4503. [2019-01-01 21:15:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4503 states. [2019-01-01 21:15:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 6012 transitions. [2019-01-01 21:15:25,677 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 6012 transitions. Word has length 82 [2019-01-01 21:15:25,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:25,678 INFO L480 AbstractCegarLoop]: Abstraction has 4503 states and 6012 transitions. [2019-01-01 21:15:25,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 21:15:25,678 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 6012 transitions. [2019-01-01 21:15:25,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-01 21:15:25,683 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:25,684 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-01 21:15:25,685 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:25,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:25,685 INFO L82 PathProgramCache]: Analyzing trace with hash -56372555, now seen corresponding path program 1 times [2019-01-01 21:15:25,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:25,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:25,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:25,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:25,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:26,271 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-01 21:15:26,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:15:26,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 21:15:26,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 21:15:26,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 21:15:26,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 21:15:26,274 INFO L87 Difference]: Start difference. First operand 4503 states and 6012 transitions. Second operand 8 states. [2019-01-01 21:15:27,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:27,442 INFO L93 Difference]: Finished difference Result 9414 states and 12498 transitions. [2019-01-01 21:15:27,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 21:15:27,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-01-01 21:15:27,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:27,470 INFO L225 Difference]: With dead ends: 9414 [2019-01-01 21:15:27,470 INFO L226 Difference]: Without dead ends: 5348 [2019-01-01 21:15:27,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-01-01 21:15:27,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5348 states. [2019-01-01 21:15:27,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5348 to 5008. [2019-01-01 21:15:27,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5008 states. [2019-01-01 21:15:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5008 states to 5008 states and 6613 transitions. [2019-01-01 21:15:27,647 INFO L78 Accepts]: Start accepts. Automaton has 5008 states and 6613 transitions. Word has length 82 [2019-01-01 21:15:27,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:27,648 INFO L480 AbstractCegarLoop]: Abstraction has 5008 states and 6613 transitions. [2019-01-01 21:15:27,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 21:15:27,648 INFO L276 IsEmpty]: Start isEmpty. Operand 5008 states and 6613 transitions. [2019-01-01 21:15:27,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-01 21:15:27,652 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:27,652 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-01 21:15:27,654 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:27,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:27,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1381975007, now seen corresponding path program 1 times [2019-01-01 21:15:27,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:27,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:27,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:27,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:27,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:27,881 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-01 21:15:27,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:15:27,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 21:15:27,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 21:15:27,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 21:15:27,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-01 21:15:27,882 INFO L87 Difference]: Start difference. First operand 5008 states and 6613 transitions. Second operand 9 states. [2019-01-01 21:15:29,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:29,032 INFO L93 Difference]: Finished difference Result 6109 states and 8006 transitions. [2019-01-01 21:15:29,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 21:15:29,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-01-01 21:15:29,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:29,050 INFO L225 Difference]: With dead ends: 6109 [2019-01-01 21:15:29,050 INFO L226 Difference]: Without dead ends: 3538 [2019-01-01 21:15:29,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-01-01 21:15:29,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3538 states. [2019-01-01 21:15:29,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3538 to 3359. [2019-01-01 21:15:29,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3359 states. [2019-01-01 21:15:29,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 3359 states and 4377 transitions. [2019-01-01 21:15:29,143 INFO L78 Accepts]: Start accepts. Automaton has 3359 states and 4377 transitions. Word has length 84 [2019-01-01 21:15:29,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:29,143 INFO L480 AbstractCegarLoop]: Abstraction has 3359 states and 4377 transitions. [2019-01-01 21:15:29,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 21:15:29,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3359 states and 4377 transitions. [2019-01-01 21:15:29,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-01 21:15:29,146 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:29,146 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-01 21:15:29,147 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:29,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:29,147 INFO L82 PathProgramCache]: Analyzing trace with hash -205126895, now seen corresponding path program 1 times [2019-01-01 21:15:29,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:29,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:29,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:29,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:29,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:15:29,874 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-01 21:15:29,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:15:29,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 21:15:29,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 21:15:29,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 21:15:29,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-01 21:15:29,876 INFO L87 Difference]: Start difference. First operand 3359 states and 4377 transitions. Second operand 9 states. [2019-01-01 21:15:30,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:15:30,796 INFO L93 Difference]: Finished difference Result 4458 states and 5761 transitions. [2019-01-01 21:15:30,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 21:15:30,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-01-01 21:15:30,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:15:30,806 INFO L225 Difference]: With dead ends: 4458 [2019-01-01 21:15:30,806 INFO L226 Difference]: Without dead ends: 1987 [2019-01-01 21:15:30,810 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-01 21:15:30,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2019-01-01 21:15:30,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1877. [2019-01-01 21:15:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-01-01 21:15:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2402 transitions. [2019-01-01 21:15:30,861 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2402 transitions. Word has length 84 [2019-01-01 21:15:30,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:15:30,861 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 2402 transitions. [2019-01-01 21:15:30,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 21:15:30,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2402 transitions. [2019-01-01 21:15:30,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-01 21:15:30,863 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:15:30,863 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-01 21:15:30,864 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:15:30,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:15:30,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1356500467, now seen corresponding path program 1 times [2019-01-01 21:15:30,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:15:30,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:15:30,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:30,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:15:30,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:15:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:15:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:15:30,966 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 21:15:31,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 09:15:31 BoogieIcfgContainer [2019-01-01 21:15:31,026 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 21:15:31,026 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:15:31,026 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:15:31,027 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:15:31,027 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:14:54" (3/4) ... [2019-01-01 21:15:31,034 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:15:31,034 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:15:31,035 INFO L168 Benchmark]: Toolchain (without parser) took 38007.53 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 354.9 MB). Free memory was 951.4 MB in the beginning and 844.4 MB in the end (delta: 107.0 MB). Peak memory consumption was 461.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:15:31,037 INFO L168 Benchmark]: CDTParser took 0.21 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-01 21:15:31,038 INFO L168 Benchmark]: CACSL2BoogieTranslator took 450.23 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:15:31,039 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.75 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:15:31,041 INFO L168 Benchmark]: Boogie Preprocessor took 127.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -191.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:15:31,043 INFO L168 Benchmark]: RCFGBuilder took 922.32 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: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:15:31,043 INFO L168 Benchmark]: TraceAbstraction took 36436.21 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 215.0 MB). Free memory was 1.1 GB in the beginning and 844.4 MB in the end (delta: 250.5 MB). Peak memory consumption was 465.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:15:31,045 INFO L168 Benchmark]: Witness Printer took 7.89 ms. Allocated memory is still 1.4 GB. Free memory is still 844.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:15:31,051 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.21 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 450.23 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.75 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 127.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -191.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 922.32 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: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36436.21 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 215.0 MB). Free memory was 1.1 GB in the beginning and 844.4 MB in the end (delta: 250.5 MB). Peak memory consumption was 465.4 MB. Max. memory is 11.5 GB. * Witness Printer took 7.89 ms. Allocated memory is still 1.4 GB. Free memory is still 844.4 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, 36.3s OverallTime, 21 OverallIterations, 4 TraceHistogramMax, 27.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2094 SDtfs, 4875 SDslu, 5085 SDs, 0 SdLazy, 6157 SolverSat, 551 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 22.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 379 GetRequests, 225 SyntacticMatches, 17 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5008occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 3832 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.9s 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...