./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/GopanReps-CAV2006-Fig1a_true-termination_true-no-overflow.c.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted-lit/GopanReps-CAV2006-Fig1a_true-termination_true-no-overflow.c.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0455ba49274114922cfe1b7739d9cb0a89e6c868 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 20:47:59,613 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:47:59,615 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:47:59,631 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:47:59,632 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:47:59,633 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:47:59,634 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:47:59,636 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:47:59,638 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:47:59,639 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:47:59,639 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:47:59,640 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:47:59,641 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:47:59,642 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:47:59,643 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:47:59,645 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:47:59,645 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:47:59,648 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:47:59,650 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:47:59,652 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:47:59,654 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:47:59,655 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:47:59,658 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:47:59,658 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:47:59,658 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:47:59,659 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:47:59,661 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:47:59,662 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:47:59,663 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:47:59,664 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:47:59,664 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:47:59,665 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:47:59,665 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:47:59,665 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:47:59,667 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:47:59,668 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:47:59,668 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-01 20:47:59,699 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:47:59,700 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:47:59,702 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:47:59,702 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:47:59,702 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:47:59,703 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:47:59,706 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:47:59,706 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:47:59,706 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:47:59,706 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:47:59,706 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:47:59,707 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:47:59,707 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:47:59,707 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:47:59,707 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:47:59,707 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:47:59,707 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:47:59,708 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:47:59,708 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:47:59,708 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:47:59,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:47:59,708 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:47:59,708 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:47:59,709 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:47:59,709 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:47:59,709 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:47:59,709 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:47:59,709 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0455ba49274114922cfe1b7739d9cb0a89e6c868 [2019-01-01 20:47:59,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:47:59,759 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:47:59,763 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:47:59,765 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:47:59,765 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:47:59,766 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/GopanReps-CAV2006-Fig1a_true-termination_true-no-overflow.c.c [2019-01-01 20:47:59,826 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dda8aa58/1b5378f237a84aac8d357e2476c2a1ab/FLAGee79a91ec [2019-01-01 20:48:00,252 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:48:00,252 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/GopanReps-CAV2006-Fig1a_true-termination_true-no-overflow.c.c [2019-01-01 20:48:00,259 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dda8aa58/1b5378f237a84aac8d357e2476c2a1ab/FLAGee79a91ec [2019-01-01 20:48:00,633 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dda8aa58/1b5378f237a84aac8d357e2476c2a1ab [2019-01-01 20:48:00,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:48:00,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:48:00,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:48:00,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:48:00,644 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:48:00,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:48:00" (1/1) ... [2019-01-01 20:48:00,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd3e7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:00, skipping insertion in model container [2019-01-01 20:48:00,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:48:00" (1/1) ... [2019-01-01 20:48:00,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:48:00,676 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:48:00,907 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:48:00,913 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:48:00,936 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:48:00,955 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:48:00,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:00 WrapperNode [2019-01-01 20:48:00,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:48:00,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:48:00,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:48:00,957 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:48:00,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:00" (1/1) ... [2019-01-01 20:48:00,975 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:00" (1/1) ... [2019-01-01 20:48:01,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:48:01,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:48:01,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:48:01,001 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:48:01,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:00" (1/1) ... [2019-01-01 20:48:01,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:00" (1/1) ... [2019-01-01 20:48:01,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:00" (1/1) ... [2019-01-01 20:48:01,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:00" (1/1) ... [2019-01-01 20:48:01,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:00" (1/1) ... [2019-01-01 20:48:01,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:00" (1/1) ... [2019-01-01 20:48:01,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:00" (1/1) ... [2019-01-01 20:48:01,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:48:01,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:48:01,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:48:01,035 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:48:01,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:00" (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 20:48:01,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:48:01,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:48:01,514 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:48:01,514 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 20:48:01,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:48:01 BoogieIcfgContainer [2019-01-01 20:48:01,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:48:01,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:48:01,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:48:01,519 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:48:01,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:48:00" (1/3) ... [2019-01-01 20:48:01,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e154f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:48:01, skipping insertion in model container [2019-01-01 20:48:01,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:48:00" (2/3) ... [2019-01-01 20:48:01,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e154f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:48:01, skipping insertion in model container [2019-01-01 20:48:01,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:48:01" (3/3) ... [2019-01-01 20:48:01,524 INFO L112 eAbstractionObserver]: Analyzing ICFG GopanReps-CAV2006-Fig1a_true-termination_true-no-overflow.c.c [2019-01-01 20:48:01,535 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:48:01,547 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-01 20:48:01,562 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-01 20:48:01,596 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:48:01,597 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:48:01,597 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:48:01,598 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:48:01,598 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:48:01,598 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:48:01,598 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:48:01,598 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:48:01,598 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:48:01,618 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-01-01 20:48:01,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-01 20:48:01,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:01,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-01 20:48:01,635 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:01,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:01,644 INFO L82 PathProgramCache]: Analyzing trace with hash 963531, now seen corresponding path program 1 times [2019-01-01 20:48:01,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:01,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:01,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:01,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:01,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:01,799 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 20:48:01,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:48:01,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:48:01,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:48:01,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:48:01,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:48:01,823 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-01-01 20:48:01,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:01,987 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2019-01-01 20:48:01,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:48:01,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-01 20:48:01,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:02,004 INFO L225 Difference]: With dead ends: 49 [2019-01-01 20:48:02,004 INFO L226 Difference]: Without dead ends: 23 [2019-01-01 20:48:02,008 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 20:48:02,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-01 20:48:02,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-01-01 20:48:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 20:48:02,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-01-01 20:48:02,050 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 4 [2019-01-01 20:48:02,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:02,051 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-01 20:48:02,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:48:02,051 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-01-01 20:48:02,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-01 20:48:02,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:02,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-01 20:48:02,052 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:02,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:02,052 INFO L82 PathProgramCache]: Analyzing trace with hash 963339, now seen corresponding path program 1 times [2019-01-01 20:48:02,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:02,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:02,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:02,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:02,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:02,096 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 20:48:02,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:48:02,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:48:02,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:48:02,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:48:02,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:48:02,101 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 3 states. [2019-01-01 20:48:02,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:02,226 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-01-01 20:48:02,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:48:02,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-01 20:48:02,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:02,228 INFO L225 Difference]: With dead ends: 21 [2019-01-01 20:48:02,228 INFO L226 Difference]: Without dead ends: 20 [2019-01-01 20:48:02,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 20:48:02,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-01 20:48:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-01 20:48:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 20:48:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-01-01 20:48:02,235 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 4 [2019-01-01 20:48:02,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:02,235 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-01-01 20:48:02,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:48:02,235 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-01-01 20:48:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-01 20:48:02,237 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:02,237 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-01 20:48:02,237 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:02,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:02,238 INFO L82 PathProgramCache]: Analyzing trace with hash 29863556, now seen corresponding path program 1 times [2019-01-01 20:48:02,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:02,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:02,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:02,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:02,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:02,287 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 20:48:02,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:48:02,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:48:02,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:48:02,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:48:02,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:48:02,289 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2019-01-01 20:48:02,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:02,339 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-01-01 20:48:02,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:48:02,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-01 20:48:02,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:02,340 INFO L225 Difference]: With dead ends: 25 [2019-01-01 20:48:02,341 INFO L226 Difference]: Without dead ends: 23 [2019-01-01 20:48:02,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 20:48:02,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-01 20:48:02,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2019-01-01 20:48:02,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 20:48:02,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-01-01 20:48:02,346 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 5 [2019-01-01 20:48:02,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:02,347 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-01-01 20:48:02,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:48:02,347 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-01-01 20:48:02,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-01 20:48:02,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:02,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:48:02,348 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:02,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:02,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1365891962, now seen corresponding path program 1 times [2019-01-01 20:48:02,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:02,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:02,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:02,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:02,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:02,381 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 20:48:02,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:48:02,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:48:02,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:48:02,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:48:02,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:48:02,382 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 3 states. [2019-01-01 20:48:02,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:02,405 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-01-01 20:48:02,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:48:02,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-01 20:48:02,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:02,406 INFO L225 Difference]: With dead ends: 18 [2019-01-01 20:48:02,406 INFO L226 Difference]: Without dead ends: 17 [2019-01-01 20:48:02,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 20:48:02,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-01 20:48:02,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-01 20:48:02,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-01 20:48:02,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-01 20:48:02,411 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 7 [2019-01-01 20:48:02,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:02,411 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-01 20:48:02,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:48:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-01 20:48:02,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 20:48:02,413 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:02,413 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:48:02,413 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:02,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:02,414 INFO L82 PathProgramCache]: Analyzing trace with hash -767237628, now seen corresponding path program 1 times [2019-01-01 20:48:02,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:02,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:02,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:02,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:02,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:02,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:02,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:02,464 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 20:48:02,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:02,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:02,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:48:02,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-01-01 20:48:02,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:48:02,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:48:02,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:48:02,585 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2019-01-01 20:48:03,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:03,186 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2019-01-01 20:48:03,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:48:03,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-01 20:48:03,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:03,189 INFO L225 Difference]: With dead ends: 43 [2019-01-01 20:48:03,189 INFO L226 Difference]: Without dead ends: 32 [2019-01-01 20:48:03,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:48:03,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-01 20:48:03,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2019-01-01 20:48:03,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-01 20:48:03,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-01-01 20:48:03,200 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 10 [2019-01-01 20:48:03,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:03,201 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-01-01 20:48:03,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:48:03,201 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-01-01 20:48:03,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 20:48:03,202 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:03,202 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 20:48:03,206 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:03,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:03,207 INFO L82 PathProgramCache]: Analyzing trace with hash -767237820, now seen corresponding path program 1 times [2019-01-01 20:48:03,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:03,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:03,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:03,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:03,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:03,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:03,260 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 20:48:03,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:03,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:03,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:03,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:03,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-01-01 20:48:03,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:48:03,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:48:03,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:48:03,309 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-01-01 20:48:03,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:03,348 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-01 20:48:03,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:48:03,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-01 20:48:03,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:03,351 INFO L225 Difference]: With dead ends: 28 [2019-01-01 20:48:03,351 INFO L226 Difference]: Without dead ends: 27 [2019-01-01 20:48:03,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:48:03,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-01 20:48:03,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-01 20:48:03,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-01 20:48:03,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-01-01 20:48:03,356 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2019-01-01 20:48:03,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:03,357 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-01-01 20:48:03,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:48:03,357 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-01-01 20:48:03,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 20:48:03,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:03,358 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1] [2019-01-01 20:48:03,358 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:03,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:03,359 INFO L82 PathProgramCache]: Analyzing trace with hash -907820867, now seen corresponding path program 2 times [2019-01-01 20:48:03,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:03,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:03,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:03,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:03,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:03,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:03,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:03,499 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 20:48:03,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:48:03,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:48:03,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:03,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:03,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:03,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-01 20:48:03,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:48:03,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:48:03,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:48:03,551 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 5 states. [2019-01-01 20:48:03,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:03,615 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-01-01 20:48:03,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:48:03,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-01 20:48:03,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:03,619 INFO L225 Difference]: With dead ends: 60 [2019-01-01 20:48:03,619 INFO L226 Difference]: Without dead ends: 59 [2019-01-01 20:48:03,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:48:03,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-01 20:48:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2019-01-01 20:48:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-01 20:48:03,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2019-01-01 20:48:03,628 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 16 [2019-01-01 20:48:03,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:03,629 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2019-01-01 20:48:03,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:48:03,629 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2019-01-01 20:48:03,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 20:48:03,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:03,631 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 20:48:03,631 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:03,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:03,631 INFO L82 PathProgramCache]: Analyzing trace with hash -537305888, now seen corresponding path program 1 times [2019-01-01 20:48:03,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:03,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:03,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:03,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:03,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:48:03,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:03,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:03,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:03,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:03,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:03,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-01-01 20:48:03,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:48:03,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:48:03,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:48:03,798 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 7 states. [2019-01-01 20:48:03,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:03,866 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2019-01-01 20:48:03,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:48:03,868 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-01-01 20:48:03,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:03,869 INFO L225 Difference]: With dead ends: 75 [2019-01-01 20:48:03,869 INFO L226 Difference]: Without dead ends: 40 [2019-01-01 20:48:03,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:48:03,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-01 20:48:03,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-01-01 20:48:03,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 20:48:03,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-01-01 20:48:03,877 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 18 [2019-01-01 20:48:03,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:03,878 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-01-01 20:48:03,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:48:03,878 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-01-01 20:48:03,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 20:48:03,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:03,879 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1] [2019-01-01 20:48:03,880 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:03,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:03,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1586405002, now seen corresponding path program 3 times [2019-01-01 20:48:03,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:03,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:03,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:03,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:03,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:04,210 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:04,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:04,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:04,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:48:04,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 20:48:04,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:04,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:04,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:04,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-01 20:48:04,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:48:04,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:48:04,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:48:04,320 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 6 states. [2019-01-01 20:48:04,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:04,389 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-01-01 20:48:04,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:48:04,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-01-01 20:48:04,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:04,390 INFO L225 Difference]: With dead ends: 42 [2019-01-01 20:48:04,391 INFO L226 Difference]: Without dead ends: 41 [2019-01-01 20:48:04,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:48:04,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-01 20:48:04,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-01-01 20:48:04,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 20:48:04,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-01-01 20:48:04,398 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 22 [2019-01-01 20:48:04,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:04,399 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-01-01 20:48:04,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:48:04,399 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-01-01 20:48:04,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-01 20:48:04,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:04,401 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1] [2019-01-01 20:48:04,402 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:04,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:04,402 INFO L82 PathProgramCache]: Analyzing trace with hash -89664657, now seen corresponding path program 4 times [2019-01-01 20:48:04,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:04,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:04,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:04,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:04,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:04,491 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:04,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:04,492 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:04,510 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:48:04,529 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:48:04,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:04,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:04,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:04,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-01 20:48:04,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:48:04,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:48:04,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:48:04,559 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 7 states. [2019-01-01 20:48:04,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:04,693 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2019-01-01 20:48:04,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:48:04,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-01-01 20:48:04,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:04,695 INFO L225 Difference]: With dead ends: 107 [2019-01-01 20:48:04,695 INFO L226 Difference]: Without dead ends: 106 [2019-01-01 20:48:04,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:48:04,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-01 20:48:04,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2019-01-01 20:48:04,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-01 20:48:04,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2019-01-01 20:48:04,718 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 28 [2019-01-01 20:48:04,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:04,718 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2019-01-01 20:48:04,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:48:04,718 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2019-01-01 20:48:04,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-01 20:48:04,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:04,723 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1] [2019-01-01 20:48:04,723 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:04,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:04,723 INFO L82 PathProgramCache]: Analyzing trace with hash 661989032, now seen corresponding path program 5 times [2019-01-01 20:48:04,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:04,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:04,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:04,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:04,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:04,980 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:04,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:04,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:04,993 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:48:05,018 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-01 20:48:05,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:05,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:05,029 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:05,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:05,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 20:48:05,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:48:05,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:48:05,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:48:05,059 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand 8 states. [2019-01-01 20:48:05,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:05,581 INFO L93 Difference]: Finished difference Result 183 states and 210 transitions. [2019-01-01 20:48:05,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:48:05,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-01-01 20:48:05,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:05,583 INFO L225 Difference]: With dead ends: 183 [2019-01-01 20:48:05,583 INFO L226 Difference]: Without dead ends: 182 [2019-01-01 20:48:05,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:48:05,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-01 20:48:05,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 111. [2019-01-01 20:48:05,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-01 20:48:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 127 transitions. [2019-01-01 20:48:05,596 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 127 transitions. Word has length 34 [2019-01-01 20:48:05,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:05,598 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 127 transitions. [2019-01-01 20:48:05,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:48:05,598 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2019-01-01 20:48:05,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-01 20:48:05,599 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:05,599 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 1, 1] [2019-01-01 20:48:05,601 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:05,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:05,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1050459643, now seen corresponding path program 2 times [2019-01-01 20:48:05,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:05,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:05,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:05,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:05,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 22 proven. 44 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 20:48:05,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:05,948 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:05,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:48:05,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:48:05,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:05,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 22 proven. 44 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 20:48:06,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:06,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 20:48:06,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:48:06,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:48:06,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:48:06,013 INFO L87 Difference]: Start difference. First operand 111 states and 127 transitions. Second operand 7 states. [2019-01-01 20:48:06,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:06,089 INFO L93 Difference]: Finished difference Result 211 states and 244 transitions. [2019-01-01 20:48:06,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:48:06,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-01-01 20:48:06,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:06,092 INFO L225 Difference]: With dead ends: 211 [2019-01-01 20:48:06,092 INFO L226 Difference]: Without dead ends: 121 [2019-01-01 20:48:06,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:48:06,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-01 20:48:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2019-01-01 20:48:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-01 20:48:06,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2019-01-01 20:48:06,104 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 36 [2019-01-01 20:48:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:06,105 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2019-01-01 20:48:06,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:48:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2019-01-01 20:48:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-01 20:48:06,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:06,106 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1] [2019-01-01 20:48:06,107 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:06,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:06,107 INFO L82 PathProgramCache]: Analyzing trace with hash 855337761, now seen corresponding path program 6 times [2019-01-01 20:48:06,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:06,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:06,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:06,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:06,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:06,245 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:06,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:06,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:06,255 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:48:06,311 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-01 20:48:06,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:06,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:06,322 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:06,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:06,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 20:48:06,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 20:48:06,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 20:48:06,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:48:06,342 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 9 states. [2019-01-01 20:48:06,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:06,534 INFO L93 Difference]: Finished difference Result 221 states and 254 transitions. [2019-01-01 20:48:06,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 20:48:06,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-01-01 20:48:06,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:06,537 INFO L225 Difference]: With dead ends: 221 [2019-01-01 20:48:06,537 INFO L226 Difference]: Without dead ends: 220 [2019-01-01 20:48:06,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:48:06,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-01-01 20:48:06,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 132. [2019-01-01 20:48:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-01 20:48:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 151 transitions. [2019-01-01 20:48:06,548 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 151 transitions. Word has length 40 [2019-01-01 20:48:06,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:06,550 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 151 transitions. [2019-01-01 20:48:06,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 20:48:06,550 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 151 transitions. [2019-01-01 20:48:06,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-01 20:48:06,551 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:06,551 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 2, 2, 2, 1, 1] [2019-01-01 20:48:06,553 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:06,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:06,554 INFO L82 PathProgramCache]: Analyzing trace with hash 74075198, now seen corresponding path program 3 times [2019-01-01 20:48:06,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:06,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:06,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:06,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:06,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:06,694 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 57 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-01 20:48:06,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:06,694 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:06,704 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:48:06,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 20:48:06,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:06,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-01-01 20:48:06,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:06,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-01-01 20:48:06,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:48:06,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:48:06,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:48:06,749 INFO L87 Difference]: Start difference. First operand 132 states and 151 transitions. Second operand 6 states. [2019-01-01 20:48:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:06,796 INFO L93 Difference]: Finished difference Result 197 states and 235 transitions. [2019-01-01 20:48:06,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:48:06,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-01-01 20:48:06,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:06,799 INFO L225 Difference]: With dead ends: 197 [2019-01-01 20:48:06,799 INFO L226 Difference]: Without dead ends: 196 [2019-01-01 20:48:06,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:48:06,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-01 20:48:06,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 192. [2019-01-01 20:48:06,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-01 20:48:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 220 transitions. [2019-01-01 20:48:06,814 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 220 transitions. Word has length 42 [2019-01-01 20:48:06,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:06,815 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 220 transitions. [2019-01-01 20:48:06,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:48:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 220 transitions. [2019-01-01 20:48:06,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-01 20:48:06,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:06,817 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1] [2019-01-01 20:48:06,817 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:06,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:06,819 INFO L82 PathProgramCache]: Analyzing trace with hash 714125530, now seen corresponding path program 7 times [2019-01-01 20:48:06,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:06,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:06,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:06,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:06,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:07,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:07,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:07,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:07,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:07,130 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:07,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:07,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 20:48:07,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 20:48:07,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 20:48:07,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:48:07,150 INFO L87 Difference]: Start difference. First operand 192 states and 220 transitions. Second operand 10 states. [2019-01-01 20:48:07,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:07,312 INFO L93 Difference]: Finished difference Result 379 states and 438 transitions. [2019-01-01 20:48:07,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 20:48:07,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2019-01-01 20:48:07,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:07,315 INFO L225 Difference]: With dead ends: 379 [2019-01-01 20:48:07,315 INFO L226 Difference]: Without dead ends: 378 [2019-01-01 20:48:07,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:48:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-01-01 20:48:07,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 219. [2019-01-01 20:48:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-01-01 20:48:07,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 252 transitions. [2019-01-01 20:48:07,328 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 252 transitions. Word has length 46 [2019-01-01 20:48:07,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:07,329 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 252 transitions. [2019-01-01 20:48:07,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 20:48:07,329 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 252 transitions. [2019-01-01 20:48:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-01 20:48:07,333 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:07,333 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1] [2019-01-01 20:48:07,333 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:07,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:07,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1497430061, now seen corresponding path program 8 times [2019-01-01 20:48:07,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:07,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:07,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:07,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:07,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:07,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:07,650 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:07,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:48:07,701 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:48:07,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:07,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:07,714 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:07,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:07,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-01 20:48:07,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 20:48:07,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 20:48:07,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:48:07,735 INFO L87 Difference]: Start difference. First operand 219 states and 252 transitions. Second operand 11 states. [2019-01-01 20:48:07,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:07,944 INFO L93 Difference]: Finished difference Result 435 states and 504 transitions. [2019-01-01 20:48:07,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 20:48:07,945 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-01-01 20:48:07,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:07,948 INFO L225 Difference]: With dead ends: 435 [2019-01-01 20:48:07,948 INFO L226 Difference]: Without dead ends: 434 [2019-01-01 20:48:07,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:48:07,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-01-01 20:48:07,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 246. [2019-01-01 20:48:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-01-01 20:48:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 284 transitions. [2019-01-01 20:48:07,962 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 284 transitions. Word has length 52 [2019-01-01 20:48:07,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:07,962 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 284 transitions. [2019-01-01 20:48:07,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 20:48:07,962 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 284 transitions. [2019-01-01 20:48:07,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-01 20:48:07,966 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:07,966 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 5, 5, 4, 4, 4, 1, 1] [2019-01-01 20:48:07,966 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:07,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:07,967 INFO L82 PathProgramCache]: Analyzing trace with hash 637474276, now seen corresponding path program 4 times [2019-01-01 20:48:07,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:07,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:07,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:07,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:07,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:08,054 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 71 proven. 70 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-01 20:48:08,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:08,055 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:08,065 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:48:08,088 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:48:08,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:08,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:08,100 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 71 proven. 70 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-01 20:48:08,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:08,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 20:48:08,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:48:08,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:48:08,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:48:08,122 INFO L87 Difference]: Start difference. First operand 246 states and 284 transitions. Second operand 8 states. [2019-01-01 20:48:08,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:08,236 INFO L93 Difference]: Finished difference Result 475 states and 552 transitions. [2019-01-01 20:48:08,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:48:08,240 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-01-01 20:48:08,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:08,241 INFO L225 Difference]: With dead ends: 475 [2019-01-01 20:48:08,241 INFO L226 Difference]: Without dead ends: 256 [2019-01-01 20:48:08,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:48:08,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-01-01 20:48:08,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 252. [2019-01-01 20:48:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-01 20:48:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 290 transitions. [2019-01-01 20:48:08,256 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 290 transitions. Word has length 54 [2019-01-01 20:48:08,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:08,256 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 290 transitions. [2019-01-01 20:48:08,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:48:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 290 transitions. [2019-01-01 20:48:08,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-01 20:48:08,259 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:08,259 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1] [2019-01-01 20:48:08,260 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:08,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:08,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1807450100, now seen corresponding path program 9 times [2019-01-01 20:48:08,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:08,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:08,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:08,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:08,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:08,427 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:08,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:08,428 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:08,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:48:08,492 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-01 20:48:08,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:08,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:08,516 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:08,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:08,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-01 20:48:08,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 20:48:08,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 20:48:08,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 20:48:08,538 INFO L87 Difference]: Start difference. First operand 252 states and 290 transitions. Second operand 12 states. [2019-01-01 20:48:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:08,737 INFO L93 Difference]: Finished difference Result 497 states and 576 transitions. [2019-01-01 20:48:08,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 20:48:08,740 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-01-01 20:48:08,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:08,742 INFO L225 Difference]: With dead ends: 497 [2019-01-01 20:48:08,743 INFO L226 Difference]: Without dead ends: 496 [2019-01-01 20:48:08,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 20:48:08,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-01-01 20:48:08,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 279. [2019-01-01 20:48:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-01-01 20:48:08,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 322 transitions. [2019-01-01 20:48:08,759 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 322 transitions. Word has length 58 [2019-01-01 20:48:08,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:08,759 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 322 transitions. [2019-01-01 20:48:08,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 20:48:08,760 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 322 transitions. [2019-01-01 20:48:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-01 20:48:08,760 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:08,761 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 6, 6, 6, 4, 4, 4, 1, 1] [2019-01-01 20:48:08,763 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:08,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:08,764 INFO L82 PathProgramCache]: Analyzing trace with hash -939039779, now seen corresponding path program 5 times [2019-01-01 20:48:08,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:08,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:08,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:08,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:08,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:08,915 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 84 proven. 102 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-01 20:48:08,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:08,915 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:08,924 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:48:08,943 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-01-01 20:48:08,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:08,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 84 proven. 102 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-01 20:48:08,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:08,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 20:48:08,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 20:48:08,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 20:48:08,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:48:08,982 INFO L87 Difference]: Start difference. First operand 279 states and 322 transitions. Second operand 9 states. [2019-01-01 20:48:09,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:09,075 INFO L93 Difference]: Finished difference Result 535 states and 622 transitions. [2019-01-01 20:48:09,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 20:48:09,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2019-01-01 20:48:09,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:09,082 INFO L225 Difference]: With dead ends: 535 [2019-01-01 20:48:09,082 INFO L226 Difference]: Without dead ends: 289 [2019-01-01 20:48:09,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:48:09,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-01 20:48:09,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2019-01-01 20:48:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-01-01 20:48:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 328 transitions. [2019-01-01 20:48:09,095 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 328 transitions. Word has length 60 [2019-01-01 20:48:09,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:09,097 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 328 transitions. [2019-01-01 20:48:09,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 20:48:09,097 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 328 transitions. [2019-01-01 20:48:09,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-01 20:48:09,099 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:09,099 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1] [2019-01-01 20:48:09,099 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:09,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:09,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1024665989, now seen corresponding path program 10 times [2019-01-01 20:48:09,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:09,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:09,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:09,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:09,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:09,606 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:09,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:09,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:09,615 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:48:09,656 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:48:09,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:09,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:09,684 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:09,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:09,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-01 20:48:09,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 20:48:09,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 20:48:09,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:48:09,719 INFO L87 Difference]: Start difference. First operand 285 states and 328 transitions. Second operand 13 states. [2019-01-01 20:48:10,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:10,173 INFO L93 Difference]: Finished difference Result 559 states and 648 transitions. [2019-01-01 20:48:10,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 20:48:10,181 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-01-01 20:48:10,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:10,185 INFO L225 Difference]: With dead ends: 559 [2019-01-01 20:48:10,185 INFO L226 Difference]: Without dead ends: 558 [2019-01-01 20:48:10,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:48:10,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-01-01 20:48:10,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 312. [2019-01-01 20:48:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-01-01 20:48:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 360 transitions. [2019-01-01 20:48:10,200 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 360 transitions. Word has length 64 [2019-01-01 20:48:10,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:10,201 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 360 transitions. [2019-01-01 20:48:10,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 20:48:10,201 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 360 transitions. [2019-01-01 20:48:10,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-01 20:48:10,202 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:10,204 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 7, 7, 7, 4, 4, 4, 1, 1] [2019-01-01 20:48:10,205 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:10,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:10,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2010223382, now seen corresponding path program 6 times [2019-01-01 20:48:10,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:10,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:10,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:10,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:10,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:11,268 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 97 proven. 140 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-01 20:48:11,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:11,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:11,290 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:48:11,406 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-01-01 20:48:11,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:11,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 135 proven. 59 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-01-01 20:48:12,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:12,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 16 [2019-01-01 20:48:12,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 20:48:12,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 20:48:12,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-01 20:48:12,125 INFO L87 Difference]: Start difference. First operand 312 states and 360 transitions. Second operand 16 states. [2019-01-01 20:48:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:12,330 INFO L93 Difference]: Finished difference Result 687 states and 813 transitions. [2019-01-01 20:48:12,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 20:48:12,332 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-01-01 20:48:12,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:12,334 INFO L225 Difference]: With dead ends: 687 [2019-01-01 20:48:12,334 INFO L226 Difference]: Without dead ends: 414 [2019-01-01 20:48:12,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-01 20:48:12,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-01-01 20:48:12,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 408. [2019-01-01 20:48:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-01-01 20:48:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 469 transitions. [2019-01-01 20:48:12,353 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 469 transitions. Word has length 66 [2019-01-01 20:48:12,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:12,353 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 469 transitions. [2019-01-01 20:48:12,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 20:48:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 469 transitions. [2019-01-01 20:48:12,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-01 20:48:12,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:12,357 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1] [2019-01-01 20:48:12,358 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:12,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:12,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1856957378, now seen corresponding path program 11 times [2019-01-01 20:48:12,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:12,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:12,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:12,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:12,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:12,555 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 363 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:12,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:12,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:12,566 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:48:12,622 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-01-01 20:48:12,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:12,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:12,644 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 363 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:12,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:12,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-01 20:48:12,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-01 20:48:12,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 20:48:12,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-01 20:48:12,666 INFO L87 Difference]: Start difference. First operand 408 states and 469 transitions. Second operand 14 states. [2019-01-01 20:48:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:12,978 INFO L93 Difference]: Finished difference Result 801 states and 928 transitions. [2019-01-01 20:48:12,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 20:48:12,982 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2019-01-01 20:48:12,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:12,987 INFO L225 Difference]: With dead ends: 801 [2019-01-01 20:48:12,988 INFO L226 Difference]: Without dead ends: 800 [2019-01-01 20:48:12,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-01 20:48:12,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-01-01 20:48:13,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 447. [2019-01-01 20:48:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-01-01 20:48:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 515 transitions. [2019-01-01 20:48:13,016 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 515 transitions. Word has length 70 [2019-01-01 20:48:13,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:13,019 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 515 transitions. [2019-01-01 20:48:13,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-01 20:48:13,019 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 515 transitions. [2019-01-01 20:48:13,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-01 20:48:13,020 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:13,020 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1] [2019-01-01 20:48:13,020 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:13,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:13,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1336389577, now seen corresponding path program 12 times [2019-01-01 20:48:13,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:13,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:13,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:13,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:13,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:13,290 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:13,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:13,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:13,301 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:48:13,449 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-01 20:48:13,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:13,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:13,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:13,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-01 20:48:13,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 20:48:13,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 20:48:13,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-01-01 20:48:13,486 INFO L87 Difference]: Start difference. First operand 447 states and 515 transitions. Second operand 15 states. [2019-01-01 20:48:13,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:13,837 INFO L93 Difference]: Finished difference Result 881 states and 1022 transitions. [2019-01-01 20:48:13,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 20:48:13,838 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2019-01-01 20:48:13,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:13,843 INFO L225 Difference]: With dead ends: 881 [2019-01-01 20:48:13,843 INFO L226 Difference]: Without dead ends: 880 [2019-01-01 20:48:13,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-01-01 20:48:13,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-01-01 20:48:13,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 486. [2019-01-01 20:48:13,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-01-01 20:48:13,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 561 transitions. [2019-01-01 20:48:13,869 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 561 transitions. Word has length 76 [2019-01-01 20:48:13,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:13,869 INFO L480 AbstractCegarLoop]: Abstraction has 486 states and 561 transitions. [2019-01-01 20:48:13,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 20:48:13,871 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 561 transitions. [2019-01-01 20:48:13,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-01 20:48:13,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:13,873 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1] [2019-01-01 20:48:13,875 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:13,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:13,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1313411728, now seen corresponding path program 13 times [2019-01-01 20:48:13,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:13,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:13,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:13,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:13,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:14,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:14,103 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:14,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:14,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:14,146 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:14,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:14,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-01 20:48:14,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 20:48:14,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 20:48:14,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-01 20:48:14,175 INFO L87 Difference]: Start difference. First operand 486 states and 561 transitions. Second operand 16 states. [2019-01-01 20:48:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:14,503 INFO L93 Difference]: Finished difference Result 961 states and 1116 transitions. [2019-01-01 20:48:14,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 20:48:14,505 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 82 [2019-01-01 20:48:14,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:14,510 INFO L225 Difference]: With dead ends: 961 [2019-01-01 20:48:14,511 INFO L226 Difference]: Without dead ends: 960 [2019-01-01 20:48:14,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-01 20:48:14,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2019-01-01 20:48:14,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 525. [2019-01-01 20:48:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-01-01 20:48:14,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 607 transitions. [2019-01-01 20:48:14,537 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 607 transitions. Word has length 82 [2019-01-01 20:48:14,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:14,539 INFO L480 AbstractCegarLoop]: Abstraction has 525 states and 607 transitions. [2019-01-01 20:48:14,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 20:48:14,539 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 607 transitions. [2019-01-01 20:48:14,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-01 20:48:14,541 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:14,542 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1] [2019-01-01 20:48:14,542 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:14,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:14,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1372652567, now seen corresponding path program 14 times [2019-01-01 20:48:14,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:14,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:14,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:14,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:14,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:14,783 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:14,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:14,784 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:14,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:48:14,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:48:14,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:14,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:14,843 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:14,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:14,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-01-01 20:48:14,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 20:48:14,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 20:48:14,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-01-01 20:48:14,866 INFO L87 Difference]: Start difference. First operand 525 states and 607 transitions. Second operand 17 states. [2019-01-01 20:48:15,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:15,111 INFO L93 Difference]: Finished difference Result 1041 states and 1210 transitions. [2019-01-01 20:48:15,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 20:48:15,112 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2019-01-01 20:48:15,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:15,116 INFO L225 Difference]: With dead ends: 1041 [2019-01-01 20:48:15,116 INFO L226 Difference]: Without dead ends: 1040 [2019-01-01 20:48:15,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-01-01 20:48:15,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-01-01 20:48:15,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 564. [2019-01-01 20:48:15,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-01-01 20:48:15,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 653 transitions. [2019-01-01 20:48:15,140 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 653 transitions. Word has length 88 [2019-01-01 20:48:15,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:15,140 INFO L480 AbstractCegarLoop]: Abstraction has 564 states and 653 transitions. [2019-01-01 20:48:15,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 20:48:15,140 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 653 transitions. [2019-01-01 20:48:15,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-01 20:48:15,144 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:15,144 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 9, 9, 9, 6, 6, 6, 1, 1] [2019-01-01 20:48:15,144 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:15,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:15,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1407885330, now seen corresponding path program 7 times [2019-01-01 20:48:15,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:15,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:15,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:15,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:15,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 199 proven. 234 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-01-01 20:48:15,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:15,311 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:15,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:15,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:15,352 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 199 proven. 234 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-01-01 20:48:15,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:15,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-01 20:48:15,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 20:48:15,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 20:48:15,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 20:48:15,372 INFO L87 Difference]: Start difference. First operand 564 states and 653 transitions. Second operand 12 states. [2019-01-01 20:48:15,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:15,452 INFO L93 Difference]: Finished difference Result 1087 states and 1266 transitions. [2019-01-01 20:48:15,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 20:48:15,453 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-01-01 20:48:15,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:15,455 INFO L225 Difference]: With dead ends: 1087 [2019-01-01 20:48:15,455 INFO L226 Difference]: Without dead ends: 574 [2019-01-01 20:48:15,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 20:48:15,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-01-01 20:48:15,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 570. [2019-01-01 20:48:15,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-01-01 20:48:15,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 659 transitions. [2019-01-01 20:48:15,473 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 659 transitions. Word has length 90 [2019-01-01 20:48:15,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:15,473 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 659 transitions. [2019-01-01 20:48:15,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 20:48:15,473 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 659 transitions. [2019-01-01 20:48:15,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-01 20:48:15,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:15,475 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1] [2019-01-01 20:48:15,475 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:15,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:15,475 INFO L82 PathProgramCache]: Analyzing trace with hash 146181026, now seen corresponding path program 15 times [2019-01-01 20:48:15,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:15,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:15,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:15,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:15,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:16,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:16,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:16,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:48:16,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-01 20:48:16,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:16,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:16,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:16,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-01 20:48:16,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-01 20:48:16,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-01 20:48:16,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-01 20:48:16,737 INFO L87 Difference]: Start difference. First operand 570 states and 659 transitions. Second operand 18 states. [2019-01-01 20:48:16,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:16,943 INFO L93 Difference]: Finished difference Result 1127 states and 1310 transitions. [2019-01-01 20:48:16,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 20:48:16,944 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 94 [2019-01-01 20:48:16,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:16,949 INFO L225 Difference]: With dead ends: 1127 [2019-01-01 20:48:16,949 INFO L226 Difference]: Without dead ends: 1126 [2019-01-01 20:48:16,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-01 20:48:16,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-01-01 20:48:16,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 609. [2019-01-01 20:48:16,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2019-01-01 20:48:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 705 transitions. [2019-01-01 20:48:16,995 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 705 transitions. Word has length 94 [2019-01-01 20:48:16,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:16,995 INFO L480 AbstractCegarLoop]: Abstraction has 609 states and 705 transitions. [2019-01-01 20:48:16,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-01 20:48:16,995 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 705 transitions. [2019-01-01 20:48:16,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-01 20:48:16,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:16,999 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 10, 10, 10, 6, 6, 6, 1, 1] [2019-01-01 20:48:17,000 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:17,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:17,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2097683097, now seen corresponding path program 8 times [2019-01-01 20:48:17,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:17,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:17,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:17,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:17,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 220 proven. 290 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-01-01 20:48:17,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:17,166 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:17,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:48:17,196 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:48:17,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:17,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 220 proven. 290 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-01-01 20:48:17,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:17,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-01 20:48:17,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 20:48:17,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 20:48:17,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:48:17,234 INFO L87 Difference]: Start difference. First operand 609 states and 705 transitions. Second operand 13 states. [2019-01-01 20:48:17,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:17,322 INFO L93 Difference]: Finished difference Result 1171 states and 1364 transitions. [2019-01-01 20:48:17,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 20:48:17,323 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-01-01 20:48:17,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:17,326 INFO L225 Difference]: With dead ends: 1171 [2019-01-01 20:48:17,326 INFO L226 Difference]: Without dead ends: 619 [2019-01-01 20:48:17,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:48:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-01-01 20:48:17,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 615. [2019-01-01 20:48:17,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-01-01 20:48:17,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 711 transitions. [2019-01-01 20:48:17,343 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 711 transitions. Word has length 96 [2019-01-01 20:48:17,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:17,344 INFO L480 AbstractCegarLoop]: Abstraction has 615 states and 711 transitions. [2019-01-01 20:48:17,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 20:48:17,344 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 711 transitions. [2019-01-01 20:48:17,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-01 20:48:17,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:17,348 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1] [2019-01-01 20:48:17,348 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:17,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:17,349 INFO L82 PathProgramCache]: Analyzing trace with hash -143151973, now seen corresponding path program 16 times [2019-01-01 20:48:17,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:17,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:17,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:17,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:17,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:17,744 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 0 proven. 768 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:17,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:17,745 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:17,754 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:48:17,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:48:17,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:17,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:17,822 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 0 proven. 768 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:17,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:17,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-01-01 20:48:17,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-01 20:48:17,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-01 20:48:17,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-01-01 20:48:17,853 INFO L87 Difference]: Start difference. First operand 615 states and 711 transitions. Second operand 19 states. [2019-01-01 20:48:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:18,215 INFO L93 Difference]: Finished difference Result 1213 states and 1410 transitions. [2019-01-01 20:48:18,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 20:48:18,216 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 100 [2019-01-01 20:48:18,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:18,220 INFO L225 Difference]: With dead ends: 1213 [2019-01-01 20:48:18,220 INFO L226 Difference]: Without dead ends: 1212 [2019-01-01 20:48:18,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-01-01 20:48:18,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-01-01 20:48:18,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 654. [2019-01-01 20:48:18,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2019-01-01 20:48:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 757 transitions. [2019-01-01 20:48:18,242 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 757 transitions. Word has length 100 [2019-01-01 20:48:18,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:18,243 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 757 transitions. [2019-01-01 20:48:18,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-01 20:48:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 757 transitions. [2019-01-01 20:48:18,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 20:48:18,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:18,244 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 11, 11, 11, 6, 6, 6, 1, 1] [2019-01-01 20:48:18,244 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:18,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:18,245 INFO L82 PathProgramCache]: Analyzing trace with hash -973820896, now seen corresponding path program 9 times [2019-01-01 20:48:18,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:18,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:18,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:18,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:18,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 241 proven. 352 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-01-01 20:48:18,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:18,489 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:18,500 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:48:18,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-01 20:48:18,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:18,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:18,695 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 282 proven. 96 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-01-01 20:48:18,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:18,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 21 [2019-01-01 20:48:18,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-01 20:48:18,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-01 20:48:18,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-01-01 20:48:18,716 INFO L87 Difference]: Start difference. First operand 654 states and 757 transitions. Second operand 21 states. [2019-01-01 20:48:18,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:18,842 INFO L93 Difference]: Finished difference Result 1337 states and 1568 transitions. [2019-01-01 20:48:18,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-01 20:48:18,843 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 102 [2019-01-01 20:48:18,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:18,846 INFO L225 Difference]: With dead ends: 1337 [2019-01-01 20:48:18,846 INFO L226 Difference]: Without dead ends: 746 [2019-01-01 20:48:18,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-01-01 20:48:18,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2019-01-01 20:48:18,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 735. [2019-01-01 20:48:18,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2019-01-01 20:48:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 849 transitions. [2019-01-01 20:48:18,869 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 849 transitions. Word has length 102 [2019-01-01 20:48:18,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:18,869 INFO L480 AbstractCegarLoop]: Abstraction has 735 states and 849 transitions. [2019-01-01 20:48:18,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-01 20:48:18,869 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 849 transitions. [2019-01-01 20:48:18,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-01 20:48:18,870 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:18,870 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1] [2019-01-01 20:48:18,874 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:18,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:18,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1288728276, now seen corresponding path program 17 times [2019-01-01 20:48:18,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:18,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:18,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:18,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:18,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:19,166 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 0 proven. 867 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:19,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:19,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:19,179 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:48:19,210 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-01-01 20:48:19,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:19,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 0 proven. 867 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:19,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:19,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-01-01 20:48:19,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 20:48:19,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 20:48:19,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-01 20:48:19,262 INFO L87 Difference]: Start difference. First operand 735 states and 849 transitions. Second operand 20 states. [2019-01-01 20:48:19,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:19,557 INFO L93 Difference]: Finished difference Result 1446 states and 1680 transitions. [2019-01-01 20:48:19,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 20:48:19,566 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 106 [2019-01-01 20:48:19,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:19,570 INFO L225 Difference]: With dead ends: 1446 [2019-01-01 20:48:19,571 INFO L226 Difference]: Without dead ends: 1445 [2019-01-01 20:48:19,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-01 20:48:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-01-01 20:48:19,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 780. [2019-01-01 20:48:19,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-01-01 20:48:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 902 transitions. [2019-01-01 20:48:19,599 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 902 transitions. Word has length 106 [2019-01-01 20:48:19,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:19,599 INFO L480 AbstractCegarLoop]: Abstraction has 780 states and 902 transitions. [2019-01-01 20:48:19,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 20:48:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 902 transitions. [2019-01-01 20:48:19,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-01 20:48:19,604 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:19,604 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1] [2019-01-01 20:48:19,607 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:19,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:19,607 INFO L82 PathProgramCache]: Analyzing trace with hash -2142051763, now seen corresponding path program 18 times [2019-01-01 20:48:19,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:19,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:19,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:19,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:19,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:21,048 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 0 proven. 972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:21,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:21,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:21,060 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:48:21,091 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-01-01 20:48:21,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:21,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:21,113 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 0 proven. 972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:21,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:21,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-01-01 20:48:21,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-01 20:48:21,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-01 20:48:21,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-01-01 20:48:21,139 INFO L87 Difference]: Start difference. First operand 780 states and 902 transitions. Second operand 21 states. [2019-01-01 20:48:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:21,387 INFO L93 Difference]: Finished difference Result 1538 states and 1788 transitions. [2019-01-01 20:48:21,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-01 20:48:21,388 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 112 [2019-01-01 20:48:21,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:21,393 INFO L225 Difference]: With dead ends: 1538 [2019-01-01 20:48:21,393 INFO L226 Difference]: Without dead ends: 1537 [2019-01-01 20:48:21,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-01-01 20:48:21,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2019-01-01 20:48:21,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 825. [2019-01-01 20:48:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-01-01 20:48:21,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 955 transitions. [2019-01-01 20:48:21,423 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 955 transitions. Word has length 112 [2019-01-01 20:48:21,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:21,424 INFO L480 AbstractCegarLoop]: Abstraction has 825 states and 955 transitions. [2019-01-01 20:48:21,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-01 20:48:21,424 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 955 transitions. [2019-01-01 20:48:21,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-01 20:48:21,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:21,428 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1] [2019-01-01 20:48:21,429 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:21,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:21,429 INFO L82 PathProgramCache]: Analyzing trace with hash -138078458, now seen corresponding path program 19 times [2019-01-01 20:48:21,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:21,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:21,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:21,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:21,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 0 proven. 1083 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:22,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:22,154 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:22,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:22,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 0 proven. 1083 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:22,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:22,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-01-01 20:48:22,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-01 20:48:22,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-01 20:48:22,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-01 20:48:22,231 INFO L87 Difference]: Start difference. First operand 825 states and 955 transitions. Second operand 22 states. [2019-01-01 20:48:22,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:22,802 INFO L93 Difference]: Finished difference Result 1630 states and 1896 transitions. [2019-01-01 20:48:22,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-01 20:48:22,803 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 118 [2019-01-01 20:48:22,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:22,811 INFO L225 Difference]: With dead ends: 1630 [2019-01-01 20:48:22,811 INFO L226 Difference]: Without dead ends: 1629 [2019-01-01 20:48:22,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-01 20:48:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2019-01-01 20:48:22,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 870. [2019-01-01 20:48:22,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-01-01 20:48:22,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1008 transitions. [2019-01-01 20:48:22,842 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1008 transitions. Word has length 118 [2019-01-01 20:48:22,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:22,843 INFO L480 AbstractCegarLoop]: Abstraction has 870 states and 1008 transitions. [2019-01-01 20:48:22,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-01 20:48:22,843 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1008 transitions. [2019-01-01 20:48:22,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-01 20:48:22,844 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:22,844 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 13, 13, 13, 7, 7, 7, 1, 1] [2019-01-01 20:48:22,845 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:22,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:22,845 INFO L82 PathProgramCache]: Analyzing trace with hash -247839675, now seen corresponding path program 10 times [2019-01-01 20:48:22,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:22,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:22,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:22,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:22,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 337 proven. 494 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-01-01 20:48:23,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:23,104 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:23,114 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:48:23,139 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:48:23,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:23,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 337 proven. 494 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-01-01 20:48:23,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:23,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-01-01 20:48:23,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 20:48:23,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 20:48:23,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-01 20:48:23,184 INFO L87 Difference]: Start difference. First operand 870 states and 1008 transitions. Second operand 16 states. [2019-01-01 20:48:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:23,275 INFO L93 Difference]: Finished difference Result 1675 states and 1952 transitions. [2019-01-01 20:48:23,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 20:48:23,280 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 120 [2019-01-01 20:48:23,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:23,285 INFO L225 Difference]: With dead ends: 1675 [2019-01-01 20:48:23,285 INFO L226 Difference]: Without dead ends: 880 [2019-01-01 20:48:23,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-01 20:48:23,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-01-01 20:48:23,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 876. [2019-01-01 20:48:23,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-01-01 20:48:23,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1014 transitions. [2019-01-01 20:48:23,313 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1014 transitions. Word has length 120 [2019-01-01 20:48:23,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:23,314 INFO L480 AbstractCegarLoop]: Abstraction has 876 states and 1014 transitions. [2019-01-01 20:48:23,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 20:48:23,314 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1014 transitions. [2019-01-01 20:48:23,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-01 20:48:23,318 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:23,318 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1] [2019-01-01 20:48:23,321 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:23,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:23,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1876878081, now seen corresponding path program 20 times [2019-01-01 20:48:23,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:23,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:23,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:23,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:23,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 1200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:23,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:23,904 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:23,915 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:48:23,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:48:23,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:23,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 1200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:23,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:23,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-01-01 20:48:23,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-01 20:48:23,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-01 20:48:23,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-01-01 20:48:23,997 INFO L87 Difference]: Start difference. First operand 876 states and 1014 transitions. Second operand 23 states. [2019-01-01 20:48:24,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:24,312 INFO L93 Difference]: Finished difference Result 1728 states and 2010 transitions. [2019-01-01 20:48:24,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-01 20:48:24,313 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 124 [2019-01-01 20:48:24,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:24,319 INFO L225 Difference]: With dead ends: 1728 [2019-01-01 20:48:24,319 INFO L226 Difference]: Without dead ends: 1727 [2019-01-01 20:48:24,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-01-01 20:48:24,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2019-01-01 20:48:24,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 921. [2019-01-01 20:48:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-01-01 20:48:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1067 transitions. [2019-01-01 20:48:24,345 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1067 transitions. Word has length 124 [2019-01-01 20:48:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:24,346 INFO L480 AbstractCegarLoop]: Abstraction has 921 states and 1067 transitions. [2019-01-01 20:48:24,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-01 20:48:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1067 transitions. [2019-01-01 20:48:24,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-01 20:48:24,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:24,350 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 14, 14, 14, 7, 7, 7, 1, 1] [2019-01-01 20:48:24,350 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:24,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:24,351 INFO L82 PathProgramCache]: Analyzing trace with hash -491999234, now seen corresponding path program 11 times [2019-01-01 20:48:24,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:24,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:24,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:24,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:24,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:24,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 362 proven. 574 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-01-01 20:48:24,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:24,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:24,666 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:48:24,700 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-01-01 20:48:24,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:24,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:24,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 362 proven. 574 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-01-01 20:48:24,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:24,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-01 20:48:24,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 20:48:24,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 20:48:24,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-01-01 20:48:24,738 INFO L87 Difference]: Start difference. First operand 921 states and 1067 transitions. Second operand 17 states. [2019-01-01 20:48:24,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:24,892 INFO L93 Difference]: Finished difference Result 1771 states and 2064 transitions. [2019-01-01 20:48:24,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 20:48:24,893 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2019-01-01 20:48:24,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:24,896 INFO L225 Difference]: With dead ends: 1771 [2019-01-01 20:48:24,896 INFO L226 Difference]: Without dead ends: 931 [2019-01-01 20:48:24,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-01-01 20:48:24,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-01-01 20:48:24,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 927. [2019-01-01 20:48:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-01-01 20:48:24,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1073 transitions. [2019-01-01 20:48:24,913 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1073 transitions. Word has length 126 [2019-01-01 20:48:24,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:24,914 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 1073 transitions. [2019-01-01 20:48:24,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 20:48:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1073 transitions. [2019-01-01 20:48:24,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-01 20:48:24,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:24,918 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1] [2019-01-01 20:48:24,918 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:24,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:24,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1721041976, now seen corresponding path program 21 times [2019-01-01 20:48:24,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:24,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:24,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:24,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:24,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:25,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1323 backedges. 0 proven. 1323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:25,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:25,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:25,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:48:25,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-01 20:48:25,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:25,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:25,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1323 backedges. 0 proven. 1323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:25,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:25,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-01-01 20:48:25,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-01 20:48:25,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-01 20:48:25,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-01 20:48:25,818 INFO L87 Difference]: Start difference. First operand 927 states and 1073 transitions. Second operand 24 states. [2019-01-01 20:48:26,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:26,106 INFO L93 Difference]: Finished difference Result 1826 states and 2124 transitions. [2019-01-01 20:48:26,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-01 20:48:26,107 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 130 [2019-01-01 20:48:26,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:26,113 INFO L225 Difference]: With dead ends: 1826 [2019-01-01 20:48:26,113 INFO L226 Difference]: Without dead ends: 1825 [2019-01-01 20:48:26,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-01 20:48:26,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2019-01-01 20:48:26,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 972. [2019-01-01 20:48:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-01-01 20:48:26,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1126 transitions. [2019-01-01 20:48:26,134 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1126 transitions. Word has length 130 [2019-01-01 20:48:26,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:26,134 INFO L480 AbstractCegarLoop]: Abstraction has 972 states and 1126 transitions. [2019-01-01 20:48:26,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-01 20:48:26,135 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1126 transitions. [2019-01-01 20:48:26,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-01 20:48:26,138 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:26,138 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 15, 15, 15, 7, 7, 7, 1, 1] [2019-01-01 20:48:26,138 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:26,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:26,138 INFO L82 PathProgramCache]: Analyzing trace with hash -339497737, now seen corresponding path program 12 times [2019-01-01 20:48:26,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:26,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:26,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:26,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:26,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 387 proven. 660 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-01-01 20:48:26,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:26,361 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:26,372 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:48:26,402 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-01-01 20:48:26,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:26,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:26,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 497 proven. 164 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-01-01 20:48:26,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:26,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 27 [2019-01-01 20:48:26,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-01 20:48:26,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-01 20:48:26,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-01-01 20:48:26,609 INFO L87 Difference]: Start difference. First operand 972 states and 1126 transitions. Second operand 27 states. [2019-01-01 20:48:26,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:26,799 INFO L93 Difference]: Finished difference Result 2063 states and 2433 transitions. [2019-01-01 20:48:26,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-01 20:48:26,801 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 132 [2019-01-01 20:48:26,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:26,806 INFO L225 Difference]: With dead ends: 2063 [2019-01-01 20:48:26,807 INFO L226 Difference]: Without dead ends: 1178 [2019-01-01 20:48:26,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-01-01 20:48:26,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-01-01 20:48:26,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1164. [2019-01-01 20:48:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2019-01-01 20:48:26,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1347 transitions. [2019-01-01 20:48:26,826 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1347 transitions. Word has length 132 [2019-01-01 20:48:26,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:26,826 INFO L480 AbstractCegarLoop]: Abstraction has 1164 states and 1347 transitions. [2019-01-01 20:48:26,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-01 20:48:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1347 transitions. [2019-01-01 20:48:26,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-01 20:48:26,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:26,832 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1] [2019-01-01 20:48:26,832 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:26,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:26,832 INFO L82 PathProgramCache]: Analyzing trace with hash -511517519, now seen corresponding path program 22 times [2019-01-01 20:48:26,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:26,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:26,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:26,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:26,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:27,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:27,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:27,864 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:27,874 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:48:27,902 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:48:27,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:27,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:27,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:27,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:27,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-01-01 20:48:27,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-01 20:48:27,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-01 20:48:27,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-01-01 20:48:27,964 INFO L87 Difference]: Start difference. First operand 1164 states and 1347 transitions. Second operand 25 states. [2019-01-01 20:48:28,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:28,330 INFO L93 Difference]: Finished difference Result 2296 states and 2670 transitions. [2019-01-01 20:48:28,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-01 20:48:28,331 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 136 [2019-01-01 20:48:28,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:28,338 INFO L225 Difference]: With dead ends: 2296 [2019-01-01 20:48:28,338 INFO L226 Difference]: Without dead ends: 2295 [2019-01-01 20:48:28,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-01-01 20:48:28,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2019-01-01 20:48:28,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 1221. [2019-01-01 20:48:28,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2019-01-01 20:48:28,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1414 transitions. [2019-01-01 20:48:28,376 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1414 transitions. Word has length 136 [2019-01-01 20:48:28,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:28,376 INFO L480 AbstractCegarLoop]: Abstraction has 1221 states and 1414 transitions. [2019-01-01 20:48:28,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-01 20:48:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1414 transitions. [2019-01-01 20:48:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-01 20:48:28,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:28,380 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1] [2019-01-01 20:48:28,381 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:28,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:28,381 INFO L82 PathProgramCache]: Analyzing trace with hash -109005206, now seen corresponding path program 23 times [2019-01-01 20:48:28,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:28,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:28,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:28,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:28,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:29,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 0 proven. 1587 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:29,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:29,067 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:29,078 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:48:29,125 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-01-01 20:48:29,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:29,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:29,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 0 proven. 1587 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:29,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:29,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-01-01 20:48:29,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-01 20:48:29,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-01 20:48:29,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-01 20:48:29,179 INFO L87 Difference]: Start difference. First operand 1221 states and 1414 transitions. Second operand 26 states. [2019-01-01 20:48:29,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:29,553 INFO L93 Difference]: Finished difference Result 2412 states and 2806 transitions. [2019-01-01 20:48:29,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-01 20:48:29,555 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 142 [2019-01-01 20:48:29,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:29,563 INFO L225 Difference]: With dead ends: 2412 [2019-01-01 20:48:29,563 INFO L226 Difference]: Without dead ends: 2411 [2019-01-01 20:48:29,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-01 20:48:29,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2019-01-01 20:48:29,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 1278. [2019-01-01 20:48:29,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1278 states. [2019-01-01 20:48:29,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1481 transitions. [2019-01-01 20:48:29,595 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1481 transitions. Word has length 142 [2019-01-01 20:48:29,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:29,598 INFO L480 AbstractCegarLoop]: Abstraction has 1278 states and 1481 transitions. [2019-01-01 20:48:29,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-01 20:48:29,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1481 transitions. [2019-01-01 20:48:29,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-01 20:48:29,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:29,601 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1] [2019-01-01 20:48:29,601 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:29,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:29,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1034378909, now seen corresponding path program 24 times [2019-01-01 20:48:29,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:29,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:29,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:29,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:29,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:30,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1728 backedges. 0 proven. 1728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:30,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:30,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:30,140 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:48:30,250 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-01-01 20:48:30,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:30,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1728 backedges. 0 proven. 1728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:30,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:30,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-01-01 20:48:30,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-01 20:48:30,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-01 20:48:30,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-01-01 20:48:30,314 INFO L87 Difference]: Start difference. First operand 1278 states and 1481 transitions. Second operand 27 states. [2019-01-01 20:48:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:30,719 INFO L93 Difference]: Finished difference Result 2528 states and 2942 transitions. [2019-01-01 20:48:30,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-01 20:48:30,720 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 148 [2019-01-01 20:48:30,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:30,731 INFO L225 Difference]: With dead ends: 2528 [2019-01-01 20:48:30,732 INFO L226 Difference]: Without dead ends: 2527 [2019-01-01 20:48:30,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-01-01 20:48:30,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2527 states. [2019-01-01 20:48:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2527 to 1335. [2019-01-01 20:48:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1335 states. [2019-01-01 20:48:30,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1548 transitions. [2019-01-01 20:48:30,789 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1548 transitions. Word has length 148 [2019-01-01 20:48:30,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:30,790 INFO L480 AbstractCegarLoop]: Abstraction has 1335 states and 1548 transitions. [2019-01-01 20:48:30,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-01 20:48:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1548 transitions. [2019-01-01 20:48:30,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-01-01 20:48:30,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:30,792 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1] [2019-01-01 20:48:30,793 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:30,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:30,794 INFO L82 PathProgramCache]: Analyzing trace with hash 872983964, now seen corresponding path program 25 times [2019-01-01 20:48:30,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:30,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:30,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:30,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:30,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:31,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1875 backedges. 0 proven. 1875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:31,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:31,471 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:31,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:31,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:31,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1875 backedges. 0 proven. 1875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:31,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:31,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-01-01 20:48:31,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-01 20:48:31,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-01 20:48:31,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-01 20:48:31,569 INFO L87 Difference]: Start difference. First operand 1335 states and 1548 transitions. Second operand 28 states. [2019-01-01 20:48:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:34,296 INFO L93 Difference]: Finished difference Result 2644 states and 3078 transitions. [2019-01-01 20:48:34,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-01 20:48:34,297 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 154 [2019-01-01 20:48:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:34,316 INFO L225 Difference]: With dead ends: 2644 [2019-01-01 20:48:34,316 INFO L226 Difference]: Without dead ends: 2643 [2019-01-01 20:48:34,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-01 20:48:34,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2019-01-01 20:48:34,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 1392. [2019-01-01 20:48:34,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2019-01-01 20:48:34,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1615 transitions. [2019-01-01 20:48:34,367 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1615 transitions. Word has length 154 [2019-01-01 20:48:34,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:34,367 INFO L480 AbstractCegarLoop]: Abstraction has 1392 states and 1615 transitions. [2019-01-01 20:48:34,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-01 20:48:34,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1615 transitions. [2019-01-01 20:48:34,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-01 20:48:34,371 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:34,372 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 17, 17, 17, 9, 9, 9, 1, 1] [2019-01-01 20:48:34,374 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:34,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:34,374 INFO L82 PathProgramCache]: Analyzing trace with hash 123673551, now seen corresponding path program 13 times [2019-01-01 20:48:34,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:34,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:34,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:34,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:34,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1619 backedges. 577 proven. 850 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-01-01 20:48:34,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:34,998 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:35,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:35,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:35,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1619 backedges. 577 proven. 850 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-01-01 20:48:35,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:35,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-01-01 20:48:35,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 20:48:35,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 20:48:35,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-01 20:48:35,094 INFO L87 Difference]: Start difference. First operand 1392 states and 1615 transitions. Second operand 20 states. [2019-01-01 20:48:35,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:35,206 INFO L93 Difference]: Finished difference Result 2695 states and 3142 transitions. [2019-01-01 20:48:35,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 20:48:35,207 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 156 [2019-01-01 20:48:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:35,210 INFO L225 Difference]: With dead ends: 2695 [2019-01-01 20:48:35,210 INFO L226 Difference]: Without dead ends: 1402 [2019-01-01 20:48:35,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-01 20:48:35,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-01-01 20:48:35,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1398. [2019-01-01 20:48:35,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1398 states. [2019-01-01 20:48:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1621 transitions. [2019-01-01 20:48:35,243 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1621 transitions. Word has length 156 [2019-01-01 20:48:35,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:35,243 INFO L480 AbstractCegarLoop]: Abstraction has 1398 states and 1621 transitions. [2019-01-01 20:48:35,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 20:48:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1621 transitions. [2019-01-01 20:48:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-01 20:48:35,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:35,248 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 1, 1] [2019-01-01 20:48:35,249 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:35,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:35,249 INFO L82 PathProgramCache]: Analyzing trace with hash 868412181, now seen corresponding path program 26 times [2019-01-01 20:48:35,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:35,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:35,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:35,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:35,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 0 proven. 2028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:36,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:36,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:36,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:48:36,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:48:36,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:36,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 0 proven. 2028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:36,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:36,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-01-01 20:48:36,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-01 20:48:36,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-01 20:48:36,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-01-01 20:48:36,433 INFO L87 Difference]: Start difference. First operand 1398 states and 1621 transitions. Second operand 29 states. [2019-01-01 20:48:38,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:38,214 INFO L93 Difference]: Finished difference Result 2766 states and 3220 transitions. [2019-01-01 20:48:38,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-01 20:48:38,215 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 160 [2019-01-01 20:48:38,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:38,219 INFO L225 Difference]: With dead ends: 2766 [2019-01-01 20:48:38,219 INFO L226 Difference]: Without dead ends: 2765 [2019-01-01 20:48:38,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-01-01 20:48:38,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2019-01-01 20:48:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 1455. [2019-01-01 20:48:38,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1455 states. [2019-01-01 20:48:38,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 1688 transitions. [2019-01-01 20:48:38,259 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 1688 transitions. Word has length 160 [2019-01-01 20:48:38,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:38,261 INFO L480 AbstractCegarLoop]: Abstraction has 1455 states and 1688 transitions. [2019-01-01 20:48:38,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-01 20:48:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1688 transitions. [2019-01-01 20:48:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-01-01 20:48:38,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:38,265 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 26, 18, 18, 18, 9, 9, 9, 1, 1] [2019-01-01 20:48:38,265 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:38,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:38,266 INFO L82 PathProgramCache]: Analyzing trace with hash 25157384, now seen corresponding path program 14 times [2019-01-01 20:48:38,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:38,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:38,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:38,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:38,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:38,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1756 backedges. 610 proven. 954 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-01-01 20:48:38,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:38,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:38,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:48:38,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:48:38,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:38,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1756 backedges. 610 proven. 954 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-01-01 20:48:38,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:38,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-01-01 20:48:38,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-01 20:48:38,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-01 20:48:38,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-01-01 20:48:38,661 INFO L87 Difference]: Start difference. First operand 1455 states and 1688 transitions. Second operand 21 states. [2019-01-01 20:48:38,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:38,843 INFO L93 Difference]: Finished difference Result 2815 states and 3282 transitions. [2019-01-01 20:48:38,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-01 20:48:38,844 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 162 [2019-01-01 20:48:38,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:38,848 INFO L225 Difference]: With dead ends: 2815 [2019-01-01 20:48:38,848 INFO L226 Difference]: Without dead ends: 1465 [2019-01-01 20:48:38,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-01-01 20:48:38,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2019-01-01 20:48:38,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1461. [2019-01-01 20:48:38,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1461 states. [2019-01-01 20:48:38,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 1694 transitions. [2019-01-01 20:48:38,883 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 1694 transitions. Word has length 162 [2019-01-01 20:48:38,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:38,883 INFO L480 AbstractCegarLoop]: Abstraction has 1461 states and 1694 transitions. [2019-01-01 20:48:38,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-01 20:48:38,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1694 transitions. [2019-01-01 20:48:38,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-01-01 20:48:38,888 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:38,888 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 1, 1] [2019-01-01 20:48:38,889 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:38,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:38,891 INFO L82 PathProgramCache]: Analyzing trace with hash -588420658, now seen corresponding path program 27 times [2019-01-01 20:48:38,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:38,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:38,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:38,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:38,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2187 backedges. 0 proven. 2187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:40,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:40,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:40,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:48:40,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-01 20:48:40,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:40,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2187 backedges. 0 proven. 2187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:40,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:40,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-01-01 20:48:40,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-01 20:48:40,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-01 20:48:40,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-01 20:48:40,379 INFO L87 Difference]: Start difference. First operand 1461 states and 1694 transitions. Second operand 30 states. [2019-01-01 20:48:42,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:42,048 INFO L93 Difference]: Finished difference Result 2888 states and 3362 transitions. [2019-01-01 20:48:42,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-01 20:48:42,050 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 166 [2019-01-01 20:48:42,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:42,057 INFO L225 Difference]: With dead ends: 2888 [2019-01-01 20:48:42,057 INFO L226 Difference]: Without dead ends: 2887 [2019-01-01 20:48:42,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-01 20:48:42,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2019-01-01 20:48:42,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 1518. [2019-01-01 20:48:42,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1518 states. [2019-01-01 20:48:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1761 transitions. [2019-01-01 20:48:42,105 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1761 transitions. Word has length 166 [2019-01-01 20:48:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:42,107 INFO L480 AbstractCegarLoop]: Abstraction has 1518 states and 1761 transitions. [2019-01-01 20:48:42,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-01 20:48:42,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1761 transitions. [2019-01-01 20:48:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-01-01 20:48:42,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:42,112 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 19, 19, 19, 9, 9, 9, 1, 1] [2019-01-01 20:48:42,113 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:42,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:42,113 INFO L82 PathProgramCache]: Analyzing trace with hash 168137601, now seen corresponding path program 15 times [2019-01-01 20:48:42,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:42,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:42,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:42,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:42,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1899 backedges. 643 proven. 1064 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-01-01 20:48:42,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:42,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:42,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:48:42,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-01 20:48:42,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:42,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:42,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1899 backedges. 720 proven. 225 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2019-01-01 20:48:42,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:42,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11] total 32 [2019-01-01 20:48:42,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-01 20:48:42,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-01 20:48:42,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-01 20:48:42,880 INFO L87 Difference]: Start difference. First operand 1518 states and 1761 transitions. Second operand 32 states. [2019-01-01 20:48:43,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:43,064 INFO L93 Difference]: Finished difference Result 3073 states and 3600 transitions. [2019-01-01 20:48:43,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-01 20:48:43,065 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 168 [2019-01-01 20:48:43,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:43,068 INFO L225 Difference]: With dead ends: 3073 [2019-01-01 20:48:43,068 INFO L226 Difference]: Without dead ends: 1666 [2019-01-01 20:48:43,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-01 20:48:43,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2019-01-01 20:48:43,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1647. [2019-01-01 20:48:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1647 states. [2019-01-01 20:48:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 1909 transitions. [2019-01-01 20:48:43,110 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 1909 transitions. Word has length 168 [2019-01-01 20:48:43,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:43,110 INFO L480 AbstractCegarLoop]: Abstraction has 1647 states and 1909 transitions. [2019-01-01 20:48:43,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-01 20:48:43,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 1909 transitions. [2019-01-01 20:48:43,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-01-01 20:48:43,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:43,115 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 1, 1] [2019-01-01 20:48:43,115 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:43,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:43,116 INFO L82 PathProgramCache]: Analyzing trace with hash 170015175, now seen corresponding path program 28 times [2019-01-01 20:48:43,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:43,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:43,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:43,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:43,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:43,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:43,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:43,615 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:48:43,652 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:48:43,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:43,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:43,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:43,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-01-01 20:48:43,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-01 20:48:43,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-01 20:48:43,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-01-01 20:48:43,712 INFO L87 Difference]: Start difference. First operand 1647 states and 1909 transitions. Second operand 31 states. [2019-01-01 20:48:44,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:44,061 INFO L93 Difference]: Finished difference Result 3253 states and 3786 transitions. [2019-01-01 20:48:44,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-01 20:48:44,062 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 172 [2019-01-01 20:48:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:44,067 INFO L225 Difference]: With dead ends: 3253 [2019-01-01 20:48:44,067 INFO L226 Difference]: Without dead ends: 3252 [2019-01-01 20:48:44,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-01-01 20:48:44,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3252 states. [2019-01-01 20:48:44,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3252 to 1710. [2019-01-01 20:48:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-01-01 20:48:44,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 1983 transitions. [2019-01-01 20:48:44,119 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 1983 transitions. Word has length 172 [2019-01-01 20:48:44,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:44,120 INFO L480 AbstractCegarLoop]: Abstraction has 1710 states and 1983 transitions. [2019-01-01 20:48:44,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-01 20:48:44,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 1983 transitions. [2019-01-01 20:48:44,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-01-01 20:48:44,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:44,121 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 1, 1] [2019-01-01 20:48:44,128 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:44,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:44,128 INFO L82 PathProgramCache]: Analyzing trace with hash 506424064, now seen corresponding path program 29 times [2019-01-01 20:48:44,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:44,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:44,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:44,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:44,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2523 backedges. 0 proven. 2523 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:44,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:44,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:44,787 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:48:44,834 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-01-01 20:48:44,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:44,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2523 backedges. 0 proven. 2523 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:44,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:44,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2019-01-01 20:48:44,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-01 20:48:44,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-01 20:48:44,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-01 20:48:44,891 INFO L87 Difference]: Start difference. First operand 1710 states and 1983 transitions. Second operand 32 states. [2019-01-01 20:48:45,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:45,271 INFO L93 Difference]: Finished difference Result 3381 states and 3936 transitions. [2019-01-01 20:48:45,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-01 20:48:45,272 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 178 [2019-01-01 20:48:45,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:45,278 INFO L225 Difference]: With dead ends: 3381 [2019-01-01 20:48:45,279 INFO L226 Difference]: Without dead ends: 3380 [2019-01-01 20:48:45,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-01 20:48:45,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3380 states. [2019-01-01 20:48:45,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3380 to 1773. [2019-01-01 20:48:45,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2019-01-01 20:48:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2057 transitions. [2019-01-01 20:48:45,355 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2057 transitions. Word has length 178 [2019-01-01 20:48:45,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:45,355 INFO L480 AbstractCegarLoop]: Abstraction has 1773 states and 2057 transitions. [2019-01-01 20:48:45,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-01 20:48:45,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2057 transitions. [2019-01-01 20:48:45,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-01 20:48:45,360 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:45,360 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 1, 1] [2019-01-01 20:48:45,360 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:45,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:45,361 INFO L82 PathProgramCache]: Analyzing trace with hash 219614585, now seen corresponding path program 30 times [2019-01-01 20:48:45,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:45,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:45,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:45,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:45,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2700 backedges. 0 proven. 2700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:46,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:46,246 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:46,257 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:48:46,311 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-01-01 20:48:46,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:46,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:46,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2700 backedges. 0 proven. 2700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:46,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:46,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-01-01 20:48:46,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-01 20:48:46,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-01 20:48:46,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-01-01 20:48:46,369 INFO L87 Difference]: Start difference. First operand 1773 states and 2057 transitions. Second operand 33 states. [2019-01-01 20:48:46,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:46,750 INFO L93 Difference]: Finished difference Result 3509 states and 4086 transitions. [2019-01-01 20:48:46,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-01 20:48:46,751 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 184 [2019-01-01 20:48:46,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:46,755 INFO L225 Difference]: With dead ends: 3509 [2019-01-01 20:48:46,755 INFO L226 Difference]: Without dead ends: 3508 [2019-01-01 20:48:46,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-01-01 20:48:46,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2019-01-01 20:48:46,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 1836. [2019-01-01 20:48:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1836 states. [2019-01-01 20:48:46,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 2131 transitions. [2019-01-01 20:48:46,795 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 2131 transitions. Word has length 184 [2019-01-01 20:48:46,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:46,798 INFO L480 AbstractCegarLoop]: Abstraction has 1836 states and 2131 transitions. [2019-01-01 20:48:46,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-01 20:48:46,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2131 transitions. [2019-01-01 20:48:46,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-01 20:48:46,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:46,802 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 21, 21, 21, 10, 10, 10, 1, 1] [2019-01-01 20:48:46,803 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:46,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:46,803 INFO L82 PathProgramCache]: Analyzing trace with hash 211921510, now seen corresponding path program 16 times [2019-01-01 20:48:46,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:46,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:46,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:46,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:46,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:47,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 795 proven. 1302 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-01-01 20:48:47,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:47,133 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:47,144 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:48:47,185 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:48:47,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:47,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:47,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 795 proven. 1302 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-01-01 20:48:47,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:47,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-01-01 20:48:47,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-01 20:48:47,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-01 20:48:47,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-01 20:48:47,239 INFO L87 Difference]: Start difference. First operand 1836 states and 2131 transitions. Second operand 24 states. [2019-01-01 20:48:47,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:47,368 INFO L93 Difference]: Finished difference Result 3559 states and 4150 transitions. [2019-01-01 20:48:47,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-01 20:48:47,369 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 186 [2019-01-01 20:48:47,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:47,373 INFO L225 Difference]: With dead ends: 3559 [2019-01-01 20:48:47,373 INFO L226 Difference]: Without dead ends: 1846 [2019-01-01 20:48:47,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-01 20:48:47,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2019-01-01 20:48:47,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1842. [2019-01-01 20:48:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2019-01-01 20:48:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2137 transitions. [2019-01-01 20:48:47,405 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2137 transitions. Word has length 186 [2019-01-01 20:48:47,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:47,405 INFO L480 AbstractCegarLoop]: Abstraction has 1842 states and 2137 transitions. [2019-01-01 20:48:47,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-01 20:48:47,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2137 transitions. [2019-01-01 20:48:47,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-01-01 20:48:47,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:47,407 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 1, 1] [2019-01-01 20:48:47,407 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:47,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:47,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1525731022, now seen corresponding path program 31 times [2019-01-01 20:48:47,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:47,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:47,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:47,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:47,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:48,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2883 backedges. 0 proven. 2883 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:48,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:48,081 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:48,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:48,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2883 backedges. 0 proven. 2883 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:48,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:48,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-01-01 20:48:48,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-01 20:48:48,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-01 20:48:48,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-01 20:48:48,188 INFO L87 Difference]: Start difference. First operand 1842 states and 2137 transitions. Second operand 34 states. [2019-01-01 20:48:48,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:48,535 INFO L93 Difference]: Finished difference Result 3643 states and 4242 transitions. [2019-01-01 20:48:48,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-01 20:48:48,537 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 190 [2019-01-01 20:48:48,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:48,541 INFO L225 Difference]: With dead ends: 3643 [2019-01-01 20:48:48,541 INFO L226 Difference]: Without dead ends: 3642 [2019-01-01 20:48:48,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-01 20:48:48,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3642 states. [2019-01-01 20:48:48,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3642 to 1905. [2019-01-01 20:48:48,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1905 states. [2019-01-01 20:48:48,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 2211 transitions. [2019-01-01 20:48:48,583 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 2211 transitions. Word has length 190 [2019-01-01 20:48:48,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:48,583 INFO L480 AbstractCegarLoop]: Abstraction has 1905 states and 2211 transitions. [2019-01-01 20:48:48,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-01 20:48:48,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2211 transitions. [2019-01-01 20:48:48,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-01 20:48:48,585 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:48,585 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 31, 22, 22, 22, 10, 10, 10, 1, 1] [2019-01-01 20:48:48,585 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:48,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:48,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2027961377, now seen corresponding path program 17 times [2019-01-01 20:48:48,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:48,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:48,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:48,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:48,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:48,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2505 backedges. 1167 proven. 488 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2019-01-01 20:48:48,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:48,863 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:48,885 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:48:48,998 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-01-01 20:48:48,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:49,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:49,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2505 backedges. 832 proven. 1430 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-01-01 20:48:49,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:49,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24] total 40 [2019-01-01 20:48:49,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-01 20:48:49,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-01 20:48:49,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-01 20:48:49,852 INFO L87 Difference]: Start difference. First operand 1905 states and 2211 transitions. Second operand 40 states. [2019-01-01 20:48:50,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:50,088 INFO L93 Difference]: Finished difference Result 4326 states and 5145 transitions. [2019-01-01 20:48:50,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-01 20:48:50,090 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 192 [2019-01-01 20:48:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:50,094 INFO L225 Difference]: With dead ends: 4326 [2019-01-01 20:48:50,095 INFO L226 Difference]: Without dead ends: 2550 [2019-01-01 20:48:50,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-01 20:48:50,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2019-01-01 20:48:50,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2532. [2019-01-01 20:48:50,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2532 states. [2019-01-01 20:48:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 2938 transitions. [2019-01-01 20:48:50,135 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 2938 transitions. Word has length 192 [2019-01-01 20:48:50,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:50,136 INFO L480 AbstractCegarLoop]: Abstraction has 2532 states and 2938 transitions. [2019-01-01 20:48:50,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-01 20:48:50,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 2938 transitions. [2019-01-01 20:48:50,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-01-01 20:48:50,137 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:50,137 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 1, 1] [2019-01-01 20:48:50,138 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:50,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:50,138 INFO L82 PathProgramCache]: Analyzing trace with hash 394389035, now seen corresponding path program 32 times [2019-01-01 20:48:50,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:50,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:50,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:50,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:50,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 0 proven. 3072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:51,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:51,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:51,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:48:51,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:48:51,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:51,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 0 proven. 3072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:51,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:51,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2019-01-01 20:48:51,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-01 20:48:51,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-01 20:48:51,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-01-01 20:48:51,437 INFO L87 Difference]: Start difference. First operand 2532 states and 2938 transitions. Second operand 35 states. [2019-01-01 20:48:51,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:51,884 INFO L93 Difference]: Finished difference Result 5028 states and 5854 transitions. [2019-01-01 20:48:51,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-01 20:48:51,885 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 196 [2019-01-01 20:48:51,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:51,892 INFO L225 Difference]: With dead ends: 5028 [2019-01-01 20:48:51,893 INFO L226 Difference]: Without dead ends: 5027 [2019-01-01 20:48:51,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-01-01 20:48:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5027 states. [2019-01-01 20:48:51,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5027 to 2625. [2019-01-01 20:48:51,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2625 states. [2019-01-01 20:48:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2625 states and 3047 transitions. [2019-01-01 20:48:51,956 INFO L78 Accepts]: Start accepts. Automaton has 2625 states and 3047 transitions. Word has length 196 [2019-01-01 20:48:51,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:51,957 INFO L480 AbstractCegarLoop]: Abstraction has 2625 states and 3047 transitions. [2019-01-01 20:48:51,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-01 20:48:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 3047 transitions. [2019-01-01 20:48:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-01-01 20:48:51,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:51,959 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 1, 1] [2019-01-01 20:48:51,959 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:51,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:51,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1039319964, now seen corresponding path program 33 times [2019-01-01 20:48:51,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:51,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:51,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:51,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:51,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3267 backedges. 0 proven. 3267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:53,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:53,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:53,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:48:53,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-01 20:48:53,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:53,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:53,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3267 backedges. 0 proven. 3267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:53,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:53,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2019-01-01 20:48:53,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-01 20:48:53,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-01 20:48:53,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-01 20:48:53,404 INFO L87 Difference]: Start difference. First operand 2625 states and 3047 transitions. Second operand 36 states. [2019-01-01 20:48:53,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:53,890 INFO L93 Difference]: Finished difference Result 5216 states and 6074 transitions. [2019-01-01 20:48:53,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-01 20:48:53,892 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 202 [2019-01-01 20:48:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:53,897 INFO L225 Difference]: With dead ends: 5216 [2019-01-01 20:48:53,898 INFO L226 Difference]: Without dead ends: 5215 [2019-01-01 20:48:53,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-01 20:48:53,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5215 states. [2019-01-01 20:48:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5215 to 2718. [2019-01-01 20:48:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2718 states. [2019-01-01 20:48:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 3156 transitions. [2019-01-01 20:48:53,961 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 3156 transitions. Word has length 202 [2019-01-01 20:48:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:53,961 INFO L480 AbstractCegarLoop]: Abstraction has 2718 states and 3156 transitions. [2019-01-01 20:48:53,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-01 20:48:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 3156 transitions. [2019-01-01 20:48:53,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-01-01 20:48:53,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:53,963 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 1, 1] [2019-01-01 20:48:53,963 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:53,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:53,964 INFO L82 PathProgramCache]: Analyzing trace with hash 931349469, now seen corresponding path program 34 times [2019-01-01 20:48:53,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:53,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:53,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:53,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:53,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3468 backedges. 0 proven. 3468 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:56,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:56,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:56,505 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:48:56,563 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:48:56,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:56,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3468 backedges. 0 proven. 3468 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:56,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:56,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-01-01 20:48:56,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-01 20:48:56,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-01 20:48:56,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-01-01 20:48:56,693 INFO L87 Difference]: Start difference. First operand 2718 states and 3156 transitions. Second operand 37 states. [2019-01-01 20:48:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:57,421 INFO L93 Difference]: Finished difference Result 5404 states and 6294 transitions. [2019-01-01 20:48:57,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-01 20:48:57,423 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 208 [2019-01-01 20:48:57,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:57,429 INFO L225 Difference]: With dead ends: 5404 [2019-01-01 20:48:57,429 INFO L226 Difference]: Without dead ends: 5403 [2019-01-01 20:48:57,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-01-01 20:48:57,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5403 states. [2019-01-01 20:48:57,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5403 to 2811. [2019-01-01 20:48:57,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2811 states. [2019-01-01 20:48:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2811 states to 2811 states and 3265 transitions. [2019-01-01 20:48:57,496 INFO L78 Accepts]: Start accepts. Automaton has 2811 states and 3265 transitions. Word has length 208 [2019-01-01 20:48:57,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:57,496 INFO L480 AbstractCegarLoop]: Abstraction has 2811 states and 3265 transitions. [2019-01-01 20:48:57,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-01 20:48:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2811 states and 3265 transitions. [2019-01-01 20:48:57,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-01-01 20:48:57,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:57,498 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 35, 1, 1] [2019-01-01 20:48:57,499 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:57,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:57,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1997927274, now seen corresponding path program 35 times [2019-01-01 20:48:57,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:57,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:57,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:57,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:57,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:58,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 0 proven. 3675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:58,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:58,381 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:48:58,396 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:48:58,455 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-01-01 20:48:58,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:58,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 0 proven. 3675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:48:58,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:58,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2019-01-01 20:48:58,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-01 20:48:58,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-01 20:48:58,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-01 20:48:58,541 INFO L87 Difference]: Start difference. First operand 2811 states and 3265 transitions. Second operand 38 states. [2019-01-01 20:48:59,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:59,041 INFO L93 Difference]: Finished difference Result 5592 states and 6514 transitions. [2019-01-01 20:48:59,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-01 20:48:59,043 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 214 [2019-01-01 20:48:59,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:59,048 INFO L225 Difference]: With dead ends: 5592 [2019-01-01 20:48:59,048 INFO L226 Difference]: Without dead ends: 5591 [2019-01-01 20:48:59,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-01 20:48:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5591 states. [2019-01-01 20:48:59,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5591 to 2904. [2019-01-01 20:48:59,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2904 states. [2019-01-01 20:48:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2904 states to 2904 states and 3374 transitions. [2019-01-01 20:48:59,114 INFO L78 Accepts]: Start accepts. Automaton has 2904 states and 3374 transitions. Word has length 214 [2019-01-01 20:48:59,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:59,114 INFO L480 AbstractCegarLoop]: Abstraction has 2904 states and 3374 transitions. [2019-01-01 20:48:59,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-01 20:48:59,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2904 states and 3374 transitions. [2019-01-01 20:48:59,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-01-01 20:48:59,117 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:59,117 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 36, 1, 1] [2019-01-01 20:48:59,117 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:59,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:59,118 INFO L82 PathProgramCache]: Analyzing trace with hash -830757233, now seen corresponding path program 36 times [2019-01-01 20:48:59,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:59,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:59,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:59,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:59,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3888 backedges. 0 proven. 3888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:00,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:00,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:00,085 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:49:00,140 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-01-01 20:49:00,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:00,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3888 backedges. 0 proven. 3888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:00,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:00,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-01-01 20:49:00,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-01 20:49:00,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-01 20:49:00,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-01-01 20:49:00,206 INFO L87 Difference]: Start difference. First operand 2904 states and 3374 transitions. Second operand 39 states. [2019-01-01 20:49:00,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:00,641 INFO L93 Difference]: Finished difference Result 5780 states and 6734 transitions. [2019-01-01 20:49:00,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-01 20:49:00,643 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 220 [2019-01-01 20:49:00,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:00,649 INFO L225 Difference]: With dead ends: 5780 [2019-01-01 20:49:00,649 INFO L226 Difference]: Without dead ends: 5779 [2019-01-01 20:49:00,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-01-01 20:49:00,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5779 states. [2019-01-01 20:49:00,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5779 to 2997. [2019-01-01 20:49:00,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2997 states. [2019-01-01 20:49:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2997 states to 2997 states and 3483 transitions. [2019-01-01 20:49:00,728 INFO L78 Accepts]: Start accepts. Automaton has 2997 states and 3483 transitions. Word has length 220 [2019-01-01 20:49:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:00,728 INFO L480 AbstractCegarLoop]: Abstraction has 2997 states and 3483 transitions. [2019-01-01 20:49:00,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-01 20:49:00,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2997 states and 3483 transitions. [2019-01-01 20:49:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-01-01 20:49:00,731 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:00,731 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 37, 1, 1] [2019-01-01 20:49:00,731 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:00,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:00,731 INFO L82 PathProgramCache]: Analyzing trace with hash -257547832, now seen corresponding path program 37 times [2019-01-01 20:49:00,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:00,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:00,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:00,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:00,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4107 backedges. 0 proven. 4107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:02,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:02,359 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:02,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:49:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:02,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4107 backedges. 0 proven. 4107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:02,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:02,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-01-01 20:49:02,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-01 20:49:02,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-01 20:49:02,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-01 20:49:02,482 INFO L87 Difference]: Start difference. First operand 2997 states and 3483 transitions. Second operand 40 states. [2019-01-01 20:49:02,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:02,922 INFO L93 Difference]: Finished difference Result 5968 states and 6954 transitions. [2019-01-01 20:49:02,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-01 20:49:02,924 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 226 [2019-01-01 20:49:02,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:02,929 INFO L225 Difference]: With dead ends: 5968 [2019-01-01 20:49:02,929 INFO L226 Difference]: Without dead ends: 5967 [2019-01-01 20:49:02,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-01 20:49:02,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5967 states. [2019-01-01 20:49:03,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5967 to 3090. [2019-01-01 20:49:03,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3090 states. [2019-01-01 20:49:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 3592 transitions. [2019-01-01 20:49:03,015 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 3592 transitions. Word has length 226 [2019-01-01 20:49:03,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:03,015 INFO L480 AbstractCegarLoop]: Abstraction has 3090 states and 3592 transitions. [2019-01-01 20:49:03,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-01 20:49:03,016 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 3592 transitions. [2019-01-01 20:49:03,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-01-01 20:49:03,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:03,019 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 1, 1] [2019-01-01 20:49:03,019 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:03,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:03,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1324642751, now seen corresponding path program 38 times [2019-01-01 20:49:03,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:03,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:03,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:03,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:49:03,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4332 backedges. 0 proven. 4332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:03,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:03,835 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:03,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:49:03,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:49:03,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:03,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4332 backedges. 0 proven. 4332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:03,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:03,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-01-01 20:49:03,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-01 20:49:03,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-01 20:49:03,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-01-01 20:49:03,985 INFO L87 Difference]: Start difference. First operand 3090 states and 3592 transitions. Second operand 41 states. [2019-01-01 20:49:04,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:04,552 INFO L93 Difference]: Finished difference Result 6156 states and 7174 transitions. [2019-01-01 20:49:04,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-01 20:49:04,552 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 232 [2019-01-01 20:49:04,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:04,558 INFO L225 Difference]: With dead ends: 6156 [2019-01-01 20:49:04,558 INFO L226 Difference]: Without dead ends: 6155 [2019-01-01 20:49:04,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-01-01 20:49:04,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6155 states. [2019-01-01 20:49:04,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6155 to 3183. [2019-01-01 20:49:04,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-01-01 20:49:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 3701 transitions. [2019-01-01 20:49:04,632 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 3701 transitions. Word has length 232 [2019-01-01 20:49:04,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:04,633 INFO L480 AbstractCegarLoop]: Abstraction has 3183 states and 3701 transitions. [2019-01-01 20:49:04,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-01 20:49:04,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 3701 transitions. [2019-01-01 20:49:04,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-01-01 20:49:04,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:04,636 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 24, 24, 24, 15, 15, 15, 1, 1] [2019-01-01 20:49:04,636 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:04,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:04,636 INFO L82 PathProgramCache]: Analyzing trace with hash -916341104, now seen corresponding path program 18 times [2019-01-01 20:49:04,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:04,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:04,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:04,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:04,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:05,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3688 backedges. 1396 proven. 1704 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-01-01 20:49:05,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:05,171 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:05,183 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:49:05,238 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2019-01-01 20:49:05,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:05,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3688 backedges. 1550 proven. 708 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2019-01-01 20:49:05,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:05,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18] total 44 [2019-01-01 20:49:05,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-01 20:49:05,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-01 20:49:05,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-01 20:49:05,735 INFO L87 Difference]: Start difference. First operand 3183 states and 3701 transitions. Second operand 44 states. [2019-01-01 20:49:06,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:06,037 INFO L93 Difference]: Finished difference Result 6548 states and 7682 transitions. [2019-01-01 20:49:06,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-01 20:49:06,038 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 234 [2019-01-01 20:49:06,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:06,041 INFO L225 Difference]: With dead ends: 6548 [2019-01-01 20:49:06,042 INFO L226 Difference]: Without dead ends: 3506 [2019-01-01 20:49:06,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-01 20:49:06,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2019-01-01 20:49:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3483. [2019-01-01 20:49:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3483 states. [2019-01-01 20:49:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3483 states to 3483 states and 4048 transitions. [2019-01-01 20:49:06,107 INFO L78 Accepts]: Start accepts. Automaton has 3483 states and 4048 transitions. Word has length 234 [2019-01-01 20:49:06,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:06,107 INFO L480 AbstractCegarLoop]: Abstraction has 3483 states and 4048 transitions. [2019-01-01 20:49:06,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-01 20:49:06,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3483 states and 4048 transitions. [2019-01-01 20:49:06,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-01-01 20:49:06,110 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:06,110 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 39, 1, 1] [2019-01-01 20:49:06,111 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:06,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:06,111 INFO L82 PathProgramCache]: Analyzing trace with hash -209585158, now seen corresponding path program 39 times [2019-01-01 20:49:06,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:06,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:06,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:06,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:06,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4563 backedges. 0 proven. 4563 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:07,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:07,140 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:07,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:49:07,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-01 20:49:07,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:07,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4563 backedges. 0 proven. 4563 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:07,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:07,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-01-01 20:49:07,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-01 20:49:07,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-01 20:49:07,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-01 20:49:07,358 INFO L87 Difference]: Start difference. First operand 3483 states and 4048 transitions. Second operand 42 states. [2019-01-01 20:49:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:08,376 INFO L93 Difference]: Finished difference Result 6938 states and 8084 transitions. [2019-01-01 20:49:08,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-01 20:49:08,378 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 238 [2019-01-01 20:49:08,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:08,384 INFO L225 Difference]: With dead ends: 6938 [2019-01-01 20:49:08,385 INFO L226 Difference]: Without dead ends: 6937 [2019-01-01 20:49:08,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-01 20:49:08,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6937 states. [2019-01-01 20:49:08,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6937 to 3588. [2019-01-01 20:49:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-01-01 20:49:08,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 4171 transitions. [2019-01-01 20:49:08,478 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 4171 transitions. Word has length 238 [2019-01-01 20:49:08,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:08,478 INFO L480 AbstractCegarLoop]: Abstraction has 3588 states and 4171 transitions. [2019-01-01 20:49:08,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-01 20:49:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 4171 transitions. [2019-01-01 20:49:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-01-01 20:49:08,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:08,485 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 40, 1, 1] [2019-01-01 20:49:08,485 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:08,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:08,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1192458995, now seen corresponding path program 40 times [2019-01-01 20:49:08,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:08,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:08,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:08,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:08,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4800 backedges. 0 proven. 4800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:09,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:09,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:09,304 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:49:09,374 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:49:09,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:09,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:09,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4800 backedges. 0 proven. 4800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:09,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:09,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2019-01-01 20:49:09,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-01 20:49:09,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-01 20:49:09,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-01-01 20:49:09,494 INFO L87 Difference]: Start difference. First operand 3588 states and 4171 transitions. Second operand 43 states. [2019-01-01 20:49:09,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:09,940 INFO L93 Difference]: Finished difference Result 7150 states and 8332 transitions. [2019-01-01 20:49:09,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-01 20:49:09,942 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 244 [2019-01-01 20:49:09,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:09,948 INFO L225 Difference]: With dead ends: 7150 [2019-01-01 20:49:09,948 INFO L226 Difference]: Without dead ends: 7149 [2019-01-01 20:49:09,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-01-01 20:49:09,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7149 states. [2019-01-01 20:49:10,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7149 to 3693. [2019-01-01 20:49:10,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3693 states. [2019-01-01 20:49:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3693 states to 3693 states and 4294 transitions. [2019-01-01 20:49:10,036 INFO L78 Accepts]: Start accepts. Automaton has 3693 states and 4294 transitions. Word has length 244 [2019-01-01 20:49:10,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:10,037 INFO L480 AbstractCegarLoop]: Abstraction has 3693 states and 4294 transitions. [2019-01-01 20:49:10,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-01 20:49:10,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3693 states and 4294 transitions. [2019-01-01 20:49:10,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-01-01 20:49:10,040 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:10,040 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 41, 1, 1] [2019-01-01 20:49:10,041 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:10,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:10,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1359078612, now seen corresponding path program 41 times [2019-01-01 20:49:10,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:10,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:10,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:10,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:10,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5043 backedges. 0 proven. 5043 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:10,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:10,949 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:10,960 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:49:11,030 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-01-01 20:49:11,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:11,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 5043 backedges. 0 proven. 5043 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:11,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:11,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2019-01-01 20:49:11,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-01 20:49:11,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-01 20:49:11,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-01 20:49:11,105 INFO L87 Difference]: Start difference. First operand 3693 states and 4294 transitions. Second operand 44 states. [2019-01-01 20:49:11,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:11,699 INFO L93 Difference]: Finished difference Result 7362 states and 8580 transitions. [2019-01-01 20:49:11,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-01 20:49:11,701 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 250 [2019-01-01 20:49:11,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:11,708 INFO L225 Difference]: With dead ends: 7362 [2019-01-01 20:49:11,708 INFO L226 Difference]: Without dead ends: 7361 [2019-01-01 20:49:11,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-01 20:49:11,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7361 states. [2019-01-01 20:49:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7361 to 3798. [2019-01-01 20:49:11,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3798 states. [2019-01-01 20:49:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3798 states to 3798 states and 4417 transitions. [2019-01-01 20:49:11,800 INFO L78 Accepts]: Start accepts. Automaton has 3798 states and 4417 transitions. Word has length 250 [2019-01-01 20:49:11,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:11,801 INFO L480 AbstractCegarLoop]: Abstraction has 3798 states and 4417 transitions. [2019-01-01 20:49:11,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-01 20:49:11,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3798 states and 4417 transitions. [2019-01-01 20:49:11,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-01-01 20:49:11,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:11,804 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 42, 1, 1] [2019-01-01 20:49:11,805 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:11,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:11,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1414271835, now seen corresponding path program 42 times [2019-01-01 20:49:11,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:11,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:11,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:11,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:11,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5292 backedges. 0 proven. 5292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:12,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:12,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:12,715 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:49:12,786 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-01-01 20:49:12,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:12,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 5292 backedges. 0 proven. 5292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:12,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:12,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-01-01 20:49:12,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-01 20:49:12,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-01 20:49:12,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-01-01 20:49:12,877 INFO L87 Difference]: Start difference. First operand 3798 states and 4417 transitions. Second operand 45 states. [2019-01-01 20:49:13,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:13,530 INFO L93 Difference]: Finished difference Result 7574 states and 8828 transitions. [2019-01-01 20:49:13,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-01 20:49:13,532 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 256 [2019-01-01 20:49:13,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:13,539 INFO L225 Difference]: With dead ends: 7574 [2019-01-01 20:49:13,539 INFO L226 Difference]: Without dead ends: 7573 [2019-01-01 20:49:13,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-01-01 20:49:13,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7573 states. [2019-01-01 20:49:13,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7573 to 3903. [2019-01-01 20:49:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3903 states. [2019-01-01 20:49:13,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3903 states to 3903 states and 4540 transitions. [2019-01-01 20:49:13,636 INFO L78 Accepts]: Start accepts. Automaton has 3903 states and 4540 transitions. Word has length 256 [2019-01-01 20:49:13,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:13,636 INFO L480 AbstractCegarLoop]: Abstraction has 3903 states and 4540 transitions. [2019-01-01 20:49:13,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-01 20:49:13,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3903 states and 4540 transitions. [2019-01-01 20:49:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-01-01 20:49:13,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:13,640 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 42, 26, 26, 26, 17, 17, 17, 1, 1] [2019-01-01 20:49:13,640 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:13,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:13,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1382127000, now seen corresponding path program 19 times [2019-01-01 20:49:13,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:13,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:13,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:13,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:13,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:14,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4492 backedges. 1722 proven. 2002 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2019-01-01 20:49:14,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:14,133 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:14,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:49:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:14,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4492 backedges. 1722 proven. 2002 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2019-01-01 20:49:14,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:14,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-01-01 20:49:14,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-01 20:49:14,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-01 20:49:14,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-01-01 20:49:14,266 INFO L87 Difference]: Start difference. First operand 3903 states and 4540 transitions. Second operand 29 states. [2019-01-01 20:49:14,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:14,434 INFO L93 Difference]: Finished difference Result 7663 states and 8938 transitions. [2019-01-01 20:49:14,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-01 20:49:14,436 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 258 [2019-01-01 20:49:14,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:14,440 INFO L225 Difference]: With dead ends: 7663 [2019-01-01 20:49:14,440 INFO L226 Difference]: Without dead ends: 3913 [2019-01-01 20:49:14,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-01-01 20:49:14,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3913 states. [2019-01-01 20:49:14,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3913 to 3909. [2019-01-01 20:49:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3909 states. [2019-01-01 20:49:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3909 states to 3909 states and 4546 transitions. [2019-01-01 20:49:14,504 INFO L78 Accepts]: Start accepts. Automaton has 3909 states and 4546 transitions. Word has length 258 [2019-01-01 20:49:14,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:14,505 INFO L480 AbstractCegarLoop]: Abstraction has 3909 states and 4546 transitions. [2019-01-01 20:49:14,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-01 20:49:14,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3909 states and 4546 transitions. [2019-01-01 20:49:14,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-01-01 20:49:14,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:14,508 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 43, 1, 1] [2019-01-01 20:49:14,509 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:14,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:14,509 INFO L82 PathProgramCache]: Analyzing trace with hash -2082799778, now seen corresponding path program 43 times [2019-01-01 20:49:14,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:14,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:14,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:14,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:49:14,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:15,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5547 backedges. 0 proven. 5547 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:15,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:15,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:15,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:49:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:15,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5547 backedges. 0 proven. 5547 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:15,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:15,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-01-01 20:49:15,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-01 20:49:15,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-01 20:49:15,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-01 20:49:15,667 INFO L87 Difference]: Start difference. First operand 3909 states and 4546 transitions. Second operand 46 states. [2019-01-01 20:49:16,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:16,290 INFO L93 Difference]: Finished difference Result 7792 states and 9082 transitions. [2019-01-01 20:49:16,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-01 20:49:16,291 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 262 [2019-01-01 20:49:16,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:16,298 INFO L225 Difference]: With dead ends: 7792 [2019-01-01 20:49:16,298 INFO L226 Difference]: Without dead ends: 7791 [2019-01-01 20:49:16,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-01 20:49:16,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7791 states. [2019-01-01 20:49:16,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7791 to 4014. [2019-01-01 20:49:16,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4014 states. [2019-01-01 20:49:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4014 states to 4014 states and 4669 transitions. [2019-01-01 20:49:16,394 INFO L78 Accepts]: Start accepts. Automaton has 4014 states and 4669 transitions. Word has length 262 [2019-01-01 20:49:16,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:16,394 INFO L480 AbstractCegarLoop]: Abstraction has 4014 states and 4669 transitions. [2019-01-01 20:49:16,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-01 20:49:16,394 INFO L276 IsEmpty]: Start isEmpty. Operand 4014 states and 4669 transitions. [2019-01-01 20:49:16,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-01-01 20:49:16,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:16,398 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 43, 27, 27, 27, 17, 17, 17, 1, 1] [2019-01-01 20:49:16,398 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:16,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:16,399 INFO L82 PathProgramCache]: Analyzing trace with hash 407614177, now seen corresponding path program 20 times [2019-01-01 20:49:16,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:16,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:16,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:16,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:49:16,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:17,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4715 backedges. 1787 proven. 2160 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2019-01-01 20:49:17,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:17,066 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:17,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:49:17,130 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:49:17,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:17,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4715 backedges. 1787 proven. 2160 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2019-01-01 20:49:17,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:17,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-01-01 20:49:17,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-01 20:49:17,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-01 20:49:17,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-01 20:49:17,198 INFO L87 Difference]: Start difference. First operand 4014 states and 4669 transitions. Second operand 30 states. [2019-01-01 20:49:17,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:17,375 INFO L93 Difference]: Finished difference Result 7879 states and 9190 transitions. [2019-01-01 20:49:17,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-01 20:49:17,377 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 264 [2019-01-01 20:49:17,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:17,381 INFO L225 Difference]: With dead ends: 7879 [2019-01-01 20:49:17,381 INFO L226 Difference]: Without dead ends: 4024 [2019-01-01 20:49:17,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-01 20:49:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2019-01-01 20:49:17,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 4020. [2019-01-01 20:49:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4020 states. [2019-01-01 20:49:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 4675 transitions. [2019-01-01 20:49:17,451 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 4675 transitions. Word has length 264 [2019-01-01 20:49:17,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:17,451 INFO L480 AbstractCegarLoop]: Abstraction has 4020 states and 4675 transitions. [2019-01-01 20:49:17,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-01 20:49:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 4675 transitions. [2019-01-01 20:49:17,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-01-01 20:49:17,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:17,455 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 44, 1, 1] [2019-01-01 20:49:17,456 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:17,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:17,456 INFO L82 PathProgramCache]: Analyzing trace with hash -850566313, now seen corresponding path program 44 times [2019-01-01 20:49:17,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:17,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:17,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:17,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:17,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5808 backedges. 0 proven. 5808 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:18,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:18,381 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:18,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:49:18,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:49:18,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:18,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:18,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5808 backedges. 0 proven. 5808 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:18,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:18,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-01-01 20:49:18,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-01 20:49:18,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-01 20:49:18,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-01-01 20:49:18,523 INFO L87 Difference]: Start difference. First operand 4020 states and 4675 transitions. Second operand 47 states. [2019-01-01 20:49:19,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:19,111 INFO L93 Difference]: Finished difference Result 8010 states and 9336 transitions. [2019-01-01 20:49:19,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-01 20:49:19,113 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 268 [2019-01-01 20:49:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:19,121 INFO L225 Difference]: With dead ends: 8010 [2019-01-01 20:49:19,121 INFO L226 Difference]: Without dead ends: 8009 [2019-01-01 20:49:19,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-01-01 20:49:19,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8009 states. [2019-01-01 20:49:19,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8009 to 4125. [2019-01-01 20:49:19,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4125 states. [2019-01-01 20:49:19,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 4798 transitions. [2019-01-01 20:49:19,223 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 4798 transitions. Word has length 268 [2019-01-01 20:49:19,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:19,223 INFO L480 AbstractCegarLoop]: Abstraction has 4125 states and 4798 transitions. [2019-01-01 20:49:19,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-01 20:49:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 4798 transitions. [2019-01-01 20:49:19,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-01-01 20:49:19,227 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:19,227 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 44, 28, 28, 28, 17, 17, 17, 1, 1] [2019-01-01 20:49:19,227 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:19,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:19,228 INFO L82 PathProgramCache]: Analyzing trace with hash -826999654, now seen corresponding path program 21 times [2019-01-01 20:49:19,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:19,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:19,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:19,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:19,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:19,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4944 backedges. 1852 proven. 2324 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2019-01-01 20:49:19,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:19,766 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:19,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:49:19,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-01 20:49:19,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:19,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:20,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4944 backedges. 2038 proven. 904 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2019-01-01 20:49:20,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:20,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 20] total 50 [2019-01-01 20:49:20,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-01 20:49:20,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-01 20:49:20,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-01 20:49:20,457 INFO L87 Difference]: Start difference. First operand 4125 states and 4798 transitions. Second operand 50 states. [2019-01-01 20:49:20,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:20,834 INFO L93 Difference]: Finished difference Result 8460 states and 9920 transitions. [2019-01-01 20:49:20,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-01 20:49:20,835 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 270 [2019-01-01 20:49:20,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:20,839 INFO L225 Difference]: With dead ends: 8460 [2019-01-01 20:49:20,839 INFO L226 Difference]: Without dead ends: 4500 [2019-01-01 20:49:20,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-01 20:49:20,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4500 states. [2019-01-01 20:49:20,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4500 to 4473. [2019-01-01 20:49:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4473 states. [2019-01-01 20:49:20,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4473 states to 4473 states and 5201 transitions. [2019-01-01 20:49:20,912 INFO L78 Accepts]: Start accepts. Automaton has 4473 states and 5201 transitions. Word has length 270 [2019-01-01 20:49:20,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:20,912 INFO L480 AbstractCegarLoop]: Abstraction has 4473 states and 5201 transitions. [2019-01-01 20:49:20,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-01 20:49:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4473 states and 5201 transitions. [2019-01-01 20:49:20,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-01-01 20:49:20,916 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:20,916 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 45, 1, 1] [2019-01-01 20:49:20,916 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:20,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:20,916 INFO L82 PathProgramCache]: Analyzing trace with hash 907618448, now seen corresponding path program 45 times [2019-01-01 20:49:20,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:20,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:20,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:20,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:20,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6075 backedges. 0 proven. 6075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:22,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:22,081 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:22,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:49:22,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-01 20:49:22,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:22,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6075 backedges. 0 proven. 6075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:22,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:22,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-01-01 20:49:22,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-01 20:49:22,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-01 20:49:22,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-01 20:49:22,255 INFO L87 Difference]: Start difference. First operand 4473 states and 5201 transitions. Second operand 48 states. [2019-01-01 20:49:22,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:22,869 INFO L93 Difference]: Finished difference Result 8912 states and 10386 transitions. [2019-01-01 20:49:22,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-01 20:49:22,870 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 274 [2019-01-01 20:49:22,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:22,878 INFO L225 Difference]: With dead ends: 8912 [2019-01-01 20:49:22,878 INFO L226 Difference]: Without dead ends: 8911 [2019-01-01 20:49:22,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-01 20:49:22,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8911 states. [2019-01-01 20:49:23,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8911 to 4590. [2019-01-01 20:49:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4590 states. [2019-01-01 20:49:23,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4590 states to 4590 states and 5338 transitions. [2019-01-01 20:49:23,009 INFO L78 Accepts]: Start accepts. Automaton has 4590 states and 5338 transitions. Word has length 274 [2019-01-01 20:49:23,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:23,009 INFO L480 AbstractCegarLoop]: Abstraction has 4590 states and 5338 transitions. [2019-01-01 20:49:23,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-01 20:49:23,009 INFO L276 IsEmpty]: Start isEmpty. Operand 4590 states and 5338 transitions. [2019-01-01 20:49:23,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-01-01 20:49:23,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:23,013 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 1, 1] [2019-01-01 20:49:23,013 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:23,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:23,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1920966903, now seen corresponding path program 46 times [2019-01-01 20:49:23,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:23,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:23,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:23,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:23,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6348 backedges. 0 proven. 6348 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:24,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:24,009 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:24,020 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:49:24,076 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:49:24,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:24,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6348 backedges. 0 proven. 6348 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:24,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:24,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-01-01 20:49:24,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-01 20:49:24,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-01 20:49:24,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-01-01 20:49:24,152 INFO L87 Difference]: Start difference. First operand 4590 states and 5338 transitions. Second operand 49 states. [2019-01-01 20:49:24,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:24,732 INFO L93 Difference]: Finished difference Result 9148 states and 10662 transitions. [2019-01-01 20:49:24,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-01 20:49:24,734 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 280 [2019-01-01 20:49:24,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:24,742 INFO L225 Difference]: With dead ends: 9148 [2019-01-01 20:49:24,742 INFO L226 Difference]: Without dead ends: 9147 [2019-01-01 20:49:24,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-01-01 20:49:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9147 states. [2019-01-01 20:49:24,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9147 to 4707. [2019-01-01 20:49:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4707 states. [2019-01-01 20:49:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4707 states to 4707 states and 5475 transitions. [2019-01-01 20:49:24,864 INFO L78 Accepts]: Start accepts. Automaton has 4707 states and 5475 transitions. Word has length 280 [2019-01-01 20:49:24,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:24,864 INFO L480 AbstractCegarLoop]: Abstraction has 4707 states and 5475 transitions. [2019-01-01 20:49:24,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-01 20:49:24,864 INFO L276 IsEmpty]: Start isEmpty. Operand 4707 states and 5475 transitions. [2019-01-01 20:49:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-01-01 20:49:24,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:24,868 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 47, 1, 1] [2019-01-01 20:49:24,869 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:24,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:24,869 INFO L82 PathProgramCache]: Analyzing trace with hash 217650882, now seen corresponding path program 47 times [2019-01-01 20:49:24,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:24,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:24,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:24,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:24,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6627 backedges. 0 proven. 6627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:25,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:25,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:25,845 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:49:25,936 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-01-01 20:49:25,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:25,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:26,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6627 backedges. 0 proven. 6627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:26,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:26,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2019-01-01 20:49:26,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-01 20:49:26,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-01 20:49:26,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-01 20:49:26,068 INFO L87 Difference]: Start difference. First operand 4707 states and 5475 transitions. Second operand 50 states. [2019-01-01 20:49:26,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:26,922 INFO L93 Difference]: Finished difference Result 9384 states and 10938 transitions. [2019-01-01 20:49:26,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-01 20:49:26,923 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 286 [2019-01-01 20:49:26,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:26,932 INFO L225 Difference]: With dead ends: 9384 [2019-01-01 20:49:26,932 INFO L226 Difference]: Without dead ends: 9383 [2019-01-01 20:49:26,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-01 20:49:26,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9383 states. [2019-01-01 20:49:27,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9383 to 4824. [2019-01-01 20:49:27,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4824 states. [2019-01-01 20:49:27,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4824 states to 4824 states and 5612 transitions. [2019-01-01 20:49:27,155 INFO L78 Accepts]: Start accepts. Automaton has 4824 states and 5612 transitions. Word has length 286 [2019-01-01 20:49:27,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:27,156 INFO L480 AbstractCegarLoop]: Abstraction has 4824 states and 5612 transitions. [2019-01-01 20:49:27,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-01 20:49:27,156 INFO L276 IsEmpty]: Start isEmpty. Operand 4824 states and 5612 transitions. [2019-01-01 20:49:27,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-01-01 20:49:27,160 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:27,160 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 48, 1, 1] [2019-01-01 20:49:27,160 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:27,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:27,161 INFO L82 PathProgramCache]: Analyzing trace with hash -517120069, now seen corresponding path program 48 times [2019-01-01 20:49:27,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:27,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:27,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:27,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:27,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:28,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6912 backedges. 0 proven. 6912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:28,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:28,282 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:28,296 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:49:28,379 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-01-01 20:49:28,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:28,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6912 backedges. 0 proven. 6912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:28,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:28,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2019-01-01 20:49:28,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-01 20:49:28,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-01 20:49:28,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-01-01 20:49:28,468 INFO L87 Difference]: Start difference. First operand 4824 states and 5612 transitions. Second operand 51 states. [2019-01-01 20:49:29,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:29,106 INFO L93 Difference]: Finished difference Result 9620 states and 11214 transitions. [2019-01-01 20:49:29,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-01 20:49:29,108 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 292 [2019-01-01 20:49:29,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:29,117 INFO L225 Difference]: With dead ends: 9620 [2019-01-01 20:49:29,117 INFO L226 Difference]: Without dead ends: 9619 [2019-01-01 20:49:29,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-01-01 20:49:29,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9619 states. [2019-01-01 20:49:29,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9619 to 4941. [2019-01-01 20:49:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4941 states. [2019-01-01 20:49:29,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4941 states to 4941 states and 5749 transitions. [2019-01-01 20:49:29,247 INFO L78 Accepts]: Start accepts. Automaton has 4941 states and 5749 transitions. Word has length 292 [2019-01-01 20:49:29,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:29,247 INFO L480 AbstractCegarLoop]: Abstraction has 4941 states and 5749 transitions. [2019-01-01 20:49:29,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-01 20:49:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 4941 states and 5749 transitions. [2019-01-01 20:49:29,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-01-01 20:49:29,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:29,252 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 48, 30, 30, 30, 19, 19, 19, 1, 1] [2019-01-01 20:49:29,252 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:29,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:29,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1186482062, now seen corresponding path program 22 times [2019-01-01 20:49:29,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:29,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:29,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:29,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:29,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:29,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5868 backedges. 2226 proven. 2670 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-01-01 20:49:29,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:29,712 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:29,724 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:49:29,796 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:49:29,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:29,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5868 backedges. 2226 proven. 2670 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-01-01 20:49:29,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:29,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-01-01 20:49:29,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-01 20:49:29,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-01 20:49:29,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-01-01 20:49:29,878 INFO L87 Difference]: Start difference. First operand 4941 states and 5749 transitions. Second operand 33 states. [2019-01-01 20:49:30,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:30,113 INFO L93 Difference]: Finished difference Result 9715 states and 11332 transitions. [2019-01-01 20:49:30,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-01 20:49:30,115 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 294 [2019-01-01 20:49:30,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:30,120 INFO L225 Difference]: With dead ends: 9715 [2019-01-01 20:49:30,120 INFO L226 Difference]: Without dead ends: 4951 [2019-01-01 20:49:30,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-01-01 20:49:30,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4951 states. [2019-01-01 20:49:30,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4951 to 4947. [2019-01-01 20:49:30,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4947 states. [2019-01-01 20:49:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4947 states to 4947 states and 5755 transitions. [2019-01-01 20:49:30,206 INFO L78 Accepts]: Start accepts. Automaton has 4947 states and 5755 transitions. Word has length 294 [2019-01-01 20:49:30,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:30,206 INFO L480 AbstractCegarLoop]: Abstraction has 4947 states and 5755 transitions. [2019-01-01 20:49:30,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-01 20:49:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 4947 states and 5755 transitions. [2019-01-01 20:49:30,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-01-01 20:49:30,210 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:30,211 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 49, 1, 1] [2019-01-01 20:49:30,211 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:30,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:30,211 INFO L82 PathProgramCache]: Analyzing trace with hash -218412556, now seen corresponding path program 49 times [2019-01-01 20:49:30,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:30,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:30,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:30,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:30,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:31,393 INFO L134 CoverageAnalysis]: Checked inductivity of 7203 backedges. 0 proven. 7203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:31,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:31,393 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:31,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:49:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:31,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:31,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7203 backedges. 0 proven. 7203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:31,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:31,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2019-01-01 20:49:31,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-01 20:49:31,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-01 20:49:31,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-01 20:49:31,549 INFO L87 Difference]: Start difference. First operand 4947 states and 5755 transitions. Second operand 52 states. [2019-01-01 20:49:32,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:32,294 INFO L93 Difference]: Finished difference Result 9862 states and 11496 transitions. [2019-01-01 20:49:32,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-01 20:49:32,296 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 298 [2019-01-01 20:49:32,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:32,305 INFO L225 Difference]: With dead ends: 9862 [2019-01-01 20:49:32,305 INFO L226 Difference]: Without dead ends: 9861 [2019-01-01 20:49:32,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-01 20:49:32,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9861 states. [2019-01-01 20:49:32,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9861 to 5064. [2019-01-01 20:49:32,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5064 states. [2019-01-01 20:49:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5064 states to 5064 states and 5892 transitions. [2019-01-01 20:49:32,440 INFO L78 Accepts]: Start accepts. Automaton has 5064 states and 5892 transitions. Word has length 298 [2019-01-01 20:49:32,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:32,440 INFO L480 AbstractCegarLoop]: Abstraction has 5064 states and 5892 transitions. [2019-01-01 20:49:32,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-01 20:49:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 5064 states and 5892 transitions. [2019-01-01 20:49:32,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-01-01 20:49:32,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:32,445 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 49, 31, 31, 31, 19, 19, 19, 1, 1] [2019-01-01 20:49:32,445 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:32,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:32,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1891370901, now seen corresponding path program 23 times [2019-01-01 20:49:32,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:32,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:32,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:32,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:49:32,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6123 backedges. 2299 proven. 2852 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-01-01 20:49:32,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:32,943 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:32,955 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:49:33,029 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2019-01-01 20:49:33,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:33,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 6123 backedges. 2299 proven. 2852 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-01-01 20:49:33,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:33,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2019-01-01 20:49:33,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-01 20:49:33,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-01 20:49:33,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-01 20:49:33,192 INFO L87 Difference]: Start difference. First operand 5064 states and 5892 transitions. Second operand 34 states. [2019-01-01 20:49:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:33,384 INFO L93 Difference]: Finished difference Result 9955 states and 11612 transitions. [2019-01-01 20:49:33,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-01 20:49:33,386 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 300 [2019-01-01 20:49:33,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:33,392 INFO L225 Difference]: With dead ends: 9955 [2019-01-01 20:49:33,392 INFO L226 Difference]: Without dead ends: 5074 [2019-01-01 20:49:33,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-01 20:49:33,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5074 states. [2019-01-01 20:49:33,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5074 to 5070. [2019-01-01 20:49:33,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5070 states. [2019-01-01 20:49:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5070 states to 5070 states and 5898 transitions. [2019-01-01 20:49:33,480 INFO L78 Accepts]: Start accepts. Automaton has 5070 states and 5898 transitions. Word has length 300 [2019-01-01 20:49:33,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:33,481 INFO L480 AbstractCegarLoop]: Abstraction has 5070 states and 5898 transitions. [2019-01-01 20:49:33,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-01 20:49:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 5070 states and 5898 transitions. [2019-01-01 20:49:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-01-01 20:49:33,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:33,485 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 1, 1] [2019-01-01 20:49:33,486 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:33,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:33,486 INFO L82 PathProgramCache]: Analyzing trace with hash -260774547, now seen corresponding path program 50 times [2019-01-01 20:49:33,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:33,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:33,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:33,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:33,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:34,745 INFO L134 CoverageAnalysis]: Checked inductivity of 7500 backedges. 0 proven. 7500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:34,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:34,745 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:34,756 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:49:34,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:49:34,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:34,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:34,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7500 backedges. 0 proven. 7500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:34,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:34,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2019-01-01 20:49:34,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-01 20:49:34,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-01 20:49:34,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-01-01 20:49:34,911 INFO L87 Difference]: Start difference. First operand 5070 states and 5898 transitions. Second operand 53 states. [2019-01-01 20:49:35,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:35,577 INFO L93 Difference]: Finished difference Result 10104 states and 11778 transitions. [2019-01-01 20:49:35,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-01 20:49:35,579 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 304 [2019-01-01 20:49:35,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:35,588 INFO L225 Difference]: With dead ends: 10104 [2019-01-01 20:49:35,588 INFO L226 Difference]: Without dead ends: 10103 [2019-01-01 20:49:35,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-01-01 20:49:35,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10103 states. [2019-01-01 20:49:35,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10103 to 5187. [2019-01-01 20:49:35,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5187 states. [2019-01-01 20:49:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5187 states to 5187 states and 6035 transitions. [2019-01-01 20:49:35,720 INFO L78 Accepts]: Start accepts. Automaton has 5187 states and 6035 transitions. Word has length 304 [2019-01-01 20:49:35,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:35,720 INFO L480 AbstractCegarLoop]: Abstraction has 5187 states and 6035 transitions. [2019-01-01 20:49:35,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-01 20:49:35,721 INFO L276 IsEmpty]: Start isEmpty. Operand 5187 states and 6035 transitions. [2019-01-01 20:49:35,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-01-01 20:49:35,725 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:35,725 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 50, 32, 32, 32, 19, 19, 19, 1, 1] [2019-01-01 20:49:35,725 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:35,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:35,726 INFO L82 PathProgramCache]: Analyzing trace with hash 348428708, now seen corresponding path program 24 times [2019-01-01 20:49:35,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:35,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:35,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:35,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:35,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 2372 proven. 3040 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-01-01 20:49:36,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:36,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:36,311 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:49:36,383 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2019-01-01 20:49:36,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:36,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 2372 proven. 3040 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-01-01 20:49:36,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:36,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2019-01-01 20:49:36,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-01 20:49:36,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-01 20:49:36,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-01-01 20:49:36,463 INFO L87 Difference]: Start difference. First operand 5187 states and 6035 transitions. Second operand 35 states. [2019-01-01 20:49:36,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:36,664 INFO L93 Difference]: Finished difference Result 10195 states and 11892 transitions. [2019-01-01 20:49:36,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-01 20:49:36,666 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 306 [2019-01-01 20:49:36,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:36,671 INFO L225 Difference]: With dead ends: 10195 [2019-01-01 20:49:36,671 INFO L226 Difference]: Without dead ends: 5197 [2019-01-01 20:49:36,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-01-01 20:49:36,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5197 states. [2019-01-01 20:49:36,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5197 to 5193. [2019-01-01 20:49:36,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5193 states. [2019-01-01 20:49:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5193 states to 5193 states and 6041 transitions. [2019-01-01 20:49:36,760 INFO L78 Accepts]: Start accepts. Automaton has 5193 states and 6041 transitions. Word has length 306 [2019-01-01 20:49:36,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:36,760 INFO L480 AbstractCegarLoop]: Abstraction has 5193 states and 6041 transitions. [2019-01-01 20:49:36,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-01 20:49:36,761 INFO L276 IsEmpty]: Start isEmpty. Operand 5193 states and 6041 transitions. [2019-01-01 20:49:36,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-01-01 20:49:36,765 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:36,765 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 51, 1, 1] [2019-01-01 20:49:36,765 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:36,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:36,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1780465114, now seen corresponding path program 51 times [2019-01-01 20:49:36,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:36,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:36,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:36,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:36,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:38,215 INFO L134 CoverageAnalysis]: Checked inductivity of 7803 backedges. 0 proven. 7803 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:38,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:38,215 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:38,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:49:38,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-01 20:49:38,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:38,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:38,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7803 backedges. 0 proven. 7803 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:38,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:38,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-01-01 20:49:38,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-01 20:49:38,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-01 20:49:38,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-01 20:49:38,415 INFO L87 Difference]: Start difference. First operand 5193 states and 6041 transitions. Second operand 54 states. [2019-01-01 20:49:39,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:39,070 INFO L93 Difference]: Finished difference Result 10346 states and 12060 transitions. [2019-01-01 20:49:39,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-01 20:49:39,070 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 310 [2019-01-01 20:49:39,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:39,080 INFO L225 Difference]: With dead ends: 10346 [2019-01-01 20:49:39,080 INFO L226 Difference]: Without dead ends: 10345 [2019-01-01 20:49:39,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-01 20:49:39,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10345 states. [2019-01-01 20:49:39,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10345 to 5310. [2019-01-01 20:49:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5310 states. [2019-01-01 20:49:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5310 states to 5310 states and 6178 transitions. [2019-01-01 20:49:39,208 INFO L78 Accepts]: Start accepts. Automaton has 5310 states and 6178 transitions. Word has length 310 [2019-01-01 20:49:39,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:39,208 INFO L480 AbstractCegarLoop]: Abstraction has 5310 states and 6178 transitions. [2019-01-01 20:49:39,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-01 20:49:39,209 INFO L276 IsEmpty]: Start isEmpty. Operand 5310 states and 6178 transitions. [2019-01-01 20:49:39,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-01-01 20:49:39,213 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:39,213 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 51, 33, 33, 33, 19, 19, 19, 1, 1] [2019-01-01 20:49:39,213 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:39,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:39,214 INFO L82 PathProgramCache]: Analyzing trace with hash 214674461, now seen corresponding path program 25 times [2019-01-01 20:49:39,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:39,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:39,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:39,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:39,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:39,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6651 backedges. 2445 proven. 3234 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-01-01 20:49:39,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:39,822 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:39,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:49:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:39,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:39,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6651 backedges. 2445 proven. 3234 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-01-01 20:49:39,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:39,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-01-01 20:49:39,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-01 20:49:39,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-01 20:49:39,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-01 20:49:39,984 INFO L87 Difference]: Start difference. First operand 5310 states and 6178 transitions. Second operand 36 states. [2019-01-01 20:49:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:40,201 INFO L93 Difference]: Finished difference Result 10435 states and 12172 transitions. [2019-01-01 20:49:40,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-01 20:49:40,203 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 312 [2019-01-01 20:49:40,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:40,208 INFO L225 Difference]: With dead ends: 10435 [2019-01-01 20:49:40,208 INFO L226 Difference]: Without dead ends: 5320 [2019-01-01 20:49:40,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-01 20:49:40,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2019-01-01 20:49:40,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 5316. [2019-01-01 20:49:40,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5316 states. [2019-01-01 20:49:40,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 6184 transitions. [2019-01-01 20:49:40,300 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 6184 transitions. Word has length 312 [2019-01-01 20:49:40,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:40,300 INFO L480 AbstractCegarLoop]: Abstraction has 5316 states and 6184 transitions. [2019-01-01 20:49:40,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-01 20:49:40,300 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 6184 transitions. [2019-01-01 20:49:40,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-01-01 20:49:40,304 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:40,305 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 52, 1, 1] [2019-01-01 20:49:40,305 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:40,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:40,305 INFO L82 PathProgramCache]: Analyzing trace with hash 917991455, now seen corresponding path program 52 times [2019-01-01 20:49:40,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:40,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:40,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:40,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:49:40,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8112 backedges. 0 proven. 8112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:49:41,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:41,469 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:41,478 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:49:41,540 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:49:41,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:41,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 8112 backedges. 8111 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 20:49:44,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:49:44,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [53] imperfect sequences [53] total 106 [2019-01-01 20:49:44,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-01 20:49:44,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-01 20:49:44,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2019-01-01 20:49:44,185 INFO L87 Difference]: Start difference. First operand 5316 states and 6184 transitions. Second operand 107 states. [2019-01-01 20:49:54,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:54,040 INFO L93 Difference]: Finished difference Result 7550 states and 8776 transitions. [2019-01-01 20:49:54,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-01-01 20:49:54,042 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 316 [2019-01-01 20:49:54,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:54,045 INFO L225 Difference]: With dead ends: 7550 [2019-01-01 20:49:54,045 INFO L226 Difference]: Without dead ends: 2435 [2019-01-01 20:49:54,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16152 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=16944, Invalid=50916, Unknown=0, NotChecked=0, Total=67860 [2019-01-01 20:49:54,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2019-01-01 20:49:54,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 421. [2019-01-01 20:49:54,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-01 20:49:54,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 438 transitions. [2019-01-01 20:49:54,072 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 438 transitions. Word has length 316 [2019-01-01 20:49:54,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:54,072 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 438 transitions. [2019-01-01 20:49:54,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-01 20:49:54,072 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 438 transitions. [2019-01-01 20:49:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-01-01 20:49:54,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:54,074 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 52, 34, 34, 34, 19, 19, 19, 1, 1] [2019-01-01 20:49:54,074 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:54,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:54,075 INFO L82 PathProgramCache]: Analyzing trace with hash -728809514, now seen corresponding path program 26 times [2019-01-01 20:49:54,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:54,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:54,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:54,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:54,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6924 backedges. 2518 proven. 3434 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-01-01 20:49:54,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:54,810 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:54,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:49:54,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:49:54,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:54,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6924 backedges. 2518 proven. 3434 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-01-01 20:49:54,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:54,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2019-01-01 20:49:54,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-01 20:49:54,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-01 20:49:54,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-01-01 20:49:54,969 INFO L87 Difference]: Start difference. First operand 421 states and 438 transitions. Second operand 37 states. [2019-01-01 20:49:55,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:55,133 INFO L93 Difference]: Finished difference Result 533 states and 550 transitions. [2019-01-01 20:49:55,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-01 20:49:55,135 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 318 [2019-01-01 20:49:55,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:55,136 INFO L225 Difference]: With dead ends: 533 [2019-01-01 20:49:55,136 INFO L226 Difference]: Without dead ends: 421 [2019-01-01 20:49:55,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-01-01 20:49:55,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-01-01 20:49:55,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2019-01-01 20:49:55,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-01 20:49:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 437 transitions. [2019-01-01 20:49:55,149 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 437 transitions. Word has length 318 [2019-01-01 20:49:55,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:55,149 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 437 transitions. [2019-01-01 20:49:55,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-01 20:49:55,149 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 437 transitions. [2019-01-01 20:49:55,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-01-01 20:49:55,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:55,151 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 53, 35, 35, 35, 19, 19, 19, 1, 1] [2019-01-01 20:49:55,151 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:55,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:55,152 INFO L82 PathProgramCache]: Analyzing trace with hash -327588657, now seen corresponding path program 27 times [2019-01-01 20:49:55,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:55,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:55,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:55,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:55,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 7203 backedges. 2591 proven. 3640 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-01-01 20:49:55,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:55,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:55,793 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:49:55,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-01 20:49:55,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:55,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7203 backedges. 2724 proven. 1045 refuted. 0 times theorem prover too weak. 3434 trivial. 0 not checked. [2019-01-01 20:49:56,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:56,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 21] total 58 [2019-01-01 20:49:56,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-01 20:49:56,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-01 20:49:56,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-01 20:49:56,674 INFO L87 Difference]: Start difference. First operand 421 states and 437 transitions. Second operand 58 states. [2019-01-01 20:49:57,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:57,160 INFO L93 Difference]: Finished difference Result 540 states and 557 transitions. [2019-01-01 20:49:57,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-01 20:49:57,162 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 324 [2019-01-01 20:49:57,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:57,163 INFO L225 Difference]: With dead ends: 540 [2019-01-01 20:49:57,163 INFO L226 Difference]: Without dead ends: 428 [2019-01-01 20:49:57,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-01 20:49:57,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-01-01 20:49:57,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 427. [2019-01-01 20:49:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-01-01 20:49:57,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 441 transitions. [2019-01-01 20:49:57,177 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 441 transitions. Word has length 324 [2019-01-01 20:49:57,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:57,178 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 441 transitions. [2019-01-01 20:49:57,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-01 20:49:57,178 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 441 transitions. [2019-01-01 20:49:57,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-01-01 20:49:57,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:57,180 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 56, 37, 37, 37, 20, 20, 20, 1, 1] [2019-01-01 20:49:57,180 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:57,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:57,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1384920524, now seen corresponding path program 28 times [2019-01-01 20:49:57,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:57,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:57,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:57,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:57,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8040 backedges. 2887 proven. 4070 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2019-01-01 20:49:58,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:58,164 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:58,176 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:49:58,239 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:49:58,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:58,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8040 backedges. 2887 proven. 4070 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2019-01-01 20:49:58,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:58,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-01-01 20:49:58,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-01 20:49:58,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-01 20:49:58,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-01 20:49:58,402 INFO L87 Difference]: Start difference. First operand 427 states and 441 transitions. Second operand 40 states. [2019-01-01 20:49:58,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:58,598 INFO L93 Difference]: Finished difference Result 545 states and 559 transitions. [2019-01-01 20:49:58,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-01 20:49:58,601 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 342 [2019-01-01 20:49:58,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:58,602 INFO L225 Difference]: With dead ends: 545 [2019-01-01 20:49:58,602 INFO L226 Difference]: Without dead ends: 427 [2019-01-01 20:49:58,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-01 20:49:58,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-01-01 20:49:58,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2019-01-01 20:49:58,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-01-01 20:49:58,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 440 transitions. [2019-01-01 20:49:58,615 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 440 transitions. Word has length 342 [2019-01-01 20:49:58,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:58,616 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 440 transitions. [2019-01-01 20:49:58,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-01 20:49:58,616 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 440 transitions. [2019-01-01 20:49:58,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-01-01 20:49:58,617 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:58,618 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 57, 38, 38, 38, 20, 20, 20, 1, 1] [2019-01-01 20:49:58,619 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:58,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:58,619 INFO L82 PathProgramCache]: Analyzing trace with hash -2060659667, now seen corresponding path program 29 times [2019-01-01 20:49:58,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:58,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:58,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:58,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:58,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:49:59,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8341 backedges. 2964 proven. 4294 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2019-01-01 20:49:59,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:49:59,354 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:49:59,365 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:49:59,457 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2019-01-01 20:49:59,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:49:59,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:49:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 8341 backedges. 2964 proven. 4294 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2019-01-01 20:49:59,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:49:59,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-01-01 20:49:59,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-01 20:49:59,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-01 20:49:59,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-01-01 20:49:59,553 INFO L87 Difference]: Start difference. First operand 427 states and 440 transitions. Second operand 41 states. [2019-01-01 20:49:59,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:49:59,824 INFO L93 Difference]: Finished difference Result 545 states and 558 transitions. [2019-01-01 20:49:59,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-01 20:49:59,825 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 348 [2019-01-01 20:49:59,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:49:59,826 INFO L225 Difference]: With dead ends: 545 [2019-01-01 20:49:59,826 INFO L226 Difference]: Without dead ends: 427 [2019-01-01 20:49:59,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-01-01 20:49:59,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-01-01 20:49:59,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2019-01-01 20:49:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-01-01 20:49:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 439 transitions. [2019-01-01 20:49:59,841 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 439 transitions. Word has length 348 [2019-01-01 20:49:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:49:59,841 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 439 transitions. [2019-01-01 20:49:59,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-01 20:49:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 439 transitions. [2019-01-01 20:49:59,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-01-01 20:49:59,843 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:49:59,843 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 58, 39, 39, 39, 20, 20, 20, 1, 1] [2019-01-01 20:49:59,843 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:49:59,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:49:59,844 INFO L82 PathProgramCache]: Analyzing trace with hash 2049621862, now seen corresponding path program 30 times [2019-01-01 20:49:59,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:49:59,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:49:59,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:59,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:49:59,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:49:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 8648 backedges. 3041 proven. 4524 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2019-01-01 20:50:00,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:50:00,570 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:50:00,582 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:50:00,674 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) [2019-01-01 20:50:00,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:50:00,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:50:00,756 INFO L134 CoverageAnalysis]: Checked inductivity of 8648 backedges. 3041 proven. 4524 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2019-01-01 20:50:00,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:50:00,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2019-01-01 20:50:00,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-01 20:50:00,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-01 20:50:00,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-01 20:50:00,778 INFO L87 Difference]: Start difference. First operand 427 states and 439 transitions. Second operand 42 states. [2019-01-01 20:50:00,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:00,988 INFO L93 Difference]: Finished difference Result 545 states and 557 transitions. [2019-01-01 20:50:00,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-01 20:50:00,990 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 354 [2019-01-01 20:50:00,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:00,992 INFO L225 Difference]: With dead ends: 545 [2019-01-01 20:50:00,992 INFO L226 Difference]: Without dead ends: 427 [2019-01-01 20:50:00,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-01 20:50:00,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-01-01 20:50:01,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2019-01-01 20:50:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-01-01 20:50:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 438 transitions. [2019-01-01 20:50:01,005 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 438 transitions. Word has length 354 [2019-01-01 20:50:01,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:01,005 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 438 transitions. [2019-01-01 20:50:01,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-01 20:50:01,005 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 438 transitions. [2019-01-01 20:50:01,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-01-01 20:50:01,007 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:01,007 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 59, 40, 40, 40, 20, 20, 20, 1, 1] [2019-01-01 20:50:01,007 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:01,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:01,008 INFO L82 PathProgramCache]: Analyzing trace with hash 487562207, now seen corresponding path program 31 times [2019-01-01 20:50:01,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:01,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:01,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:01,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:50:01,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 8961 backedges. 3118 proven. 4760 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2019-01-01 20:50:01,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:50:01,808 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:50:01,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:50:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:01,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:50:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8961 backedges. 3118 proven. 4760 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2019-01-01 20:50:02,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:50:02,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2019-01-01 20:50:02,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-01 20:50:02,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-01 20:50:02,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-01-01 20:50:02,031 INFO L87 Difference]: Start difference. First operand 427 states and 438 transitions. Second operand 43 states. [2019-01-01 20:50:02,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:02,240 INFO L93 Difference]: Finished difference Result 545 states and 556 transitions. [2019-01-01 20:50:02,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-01 20:50:02,243 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 360 [2019-01-01 20:50:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:02,243 INFO L225 Difference]: With dead ends: 545 [2019-01-01 20:50:02,243 INFO L226 Difference]: Without dead ends: 427 [2019-01-01 20:50:02,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-01-01 20:50:02,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-01-01 20:50:02,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2019-01-01 20:50:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-01-01 20:50:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 437 transitions. [2019-01-01 20:50:02,256 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 437 transitions. Word has length 360 [2019-01-01 20:50:02,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:02,257 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 437 transitions. [2019-01-01 20:50:02,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-01 20:50:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 437 transitions. [2019-01-01 20:50:02,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-01-01 20:50:02,258 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:02,259 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 60, 41, 41, 41, 20, 20, 20, 1, 1] [2019-01-01 20:50:02,259 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:02,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:02,259 INFO L82 PathProgramCache]: Analyzing trace with hash -525239912, now seen corresponding path program 32 times [2019-01-01 20:50:02,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:02,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:02,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:02,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:50:02,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:03,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9280 backedges. 3195 proven. 5002 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2019-01-01 20:50:03,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:50:03,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:50:03,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:50:03,405 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:50:03,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:50:03,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:50:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 9280 backedges. 3195 proven. 5002 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2019-01-01 20:50:03,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:50:03,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-01-01 20:50:03,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-01 20:50:03,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-01 20:50:03,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-01 20:50:03,510 INFO L87 Difference]: Start difference. First operand 427 states and 437 transitions. Second operand 44 states. [2019-01-01 20:50:04,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:04,019 INFO L93 Difference]: Finished difference Result 545 states and 555 transitions. [2019-01-01 20:50:04,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-01 20:50:04,022 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 366 [2019-01-01 20:50:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:04,023 INFO L225 Difference]: With dead ends: 545 [2019-01-01 20:50:04,023 INFO L226 Difference]: Without dead ends: 427 [2019-01-01 20:50:04,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-01 20:50:04,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-01-01 20:50:04,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2019-01-01 20:50:04,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-01-01 20:50:04,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 436 transitions. [2019-01-01 20:50:04,037 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 436 transitions. Word has length 366 [2019-01-01 20:50:04,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:04,037 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 436 transitions. [2019-01-01 20:50:04,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-01 20:50:04,037 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 436 transitions. [2019-01-01 20:50:04,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-01-01 20:50:04,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:04,040 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 61, 42, 42, 42, 20, 20, 20, 1, 1] [2019-01-01 20:50:04,040 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:04,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:04,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1558550383, now seen corresponding path program 33 times [2019-01-01 20:50:04,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:04,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:04,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:04,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:50:04,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:04,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9605 backedges. 3272 proven. 5250 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2019-01-01 20:50:04,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:50:04,878 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:50:04,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:50:04,952 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-01 20:50:04,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:50:04,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:50:05,863 INFO L134 CoverageAnalysis]: Checked inductivity of 9605 backedges. 3602 proven. 1243 refuted. 0 times theorem prover too weak. 4760 trivial. 0 not checked. [2019-01-01 20:50:05,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:50:05,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 23] total 67 [2019-01-01 20:50:05,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-01 20:50:05,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-01 20:50:05,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-01-01 20:50:05,884 INFO L87 Difference]: Start difference. First operand 427 states and 436 transitions. Second operand 67 states. [2019-01-01 20:50:06,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:06,301 INFO L93 Difference]: Finished difference Result 558 states and 569 transitions. [2019-01-01 20:50:06,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-01 20:50:06,303 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 372 [2019-01-01 20:50:06,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:06,304 INFO L225 Difference]: With dead ends: 558 [2019-01-01 20:50:06,304 INFO L226 Difference]: Without dead ends: 440 [2019-01-01 20:50:06,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-01-01 20:50:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-01-01 20:50:06,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 439. [2019-01-01 20:50:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-01-01 20:50:06,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 446 transitions. [2019-01-01 20:50:06,318 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 446 transitions. Word has length 372 [2019-01-01 20:50:06,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:06,318 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 446 transitions. [2019-01-01 20:50:06,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-01 20:50:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 446 transitions. [2019-01-01 20:50:06,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-01-01 20:50:06,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:06,321 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 65, 44, 44, 44, 22, 22, 22, 1, 1] [2019-01-01 20:50:06,321 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:06,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:06,321 INFO L82 PathProgramCache]: Analyzing trace with hash -723737495, now seen corresponding path program 34 times [2019-01-01 20:50:06,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:06,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:06,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:06,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:50:06,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10869 backedges. 3782 proven. 5764 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2019-01-01 20:50:07,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:50:07,198 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:50:07,208 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:50:07,283 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:50:07,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:50:07,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:50:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10869 backedges. 3782 proven. 5764 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2019-01-01 20:50:07,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:50:07,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-01-01 20:50:07,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-01 20:50:07,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-01 20:50:07,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-01-01 20:50:07,404 INFO L87 Difference]: Start difference. First operand 439 states and 446 transitions. Second operand 47 states. [2019-01-01 20:50:07,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:07,693 INFO L93 Difference]: Finished difference Result 569 states and 576 transitions. [2019-01-01 20:50:07,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-01 20:50:07,696 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 396 [2019-01-01 20:50:07,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:07,696 INFO L225 Difference]: With dead ends: 569 [2019-01-01 20:50:07,697 INFO L226 Difference]: Without dead ends: 439 [2019-01-01 20:50:07,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-01-01 20:50:07,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-01-01 20:50:07,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2019-01-01 20:50:07,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-01-01 20:50:07,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 445 transitions. [2019-01-01 20:50:07,711 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 445 transitions. Word has length 396 [2019-01-01 20:50:07,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:07,711 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 445 transitions. [2019-01-01 20:50:07,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-01 20:50:07,711 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 445 transitions. [2019-01-01 20:50:07,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-01-01 20:50:07,713 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:07,713 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 66, 45, 45, 45, 22, 22, 22, 1, 1] [2019-01-01 20:50:07,714 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:07,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:07,714 INFO L82 PathProgramCache]: Analyzing trace with hash 836491682, now seen corresponding path program 35 times [2019-01-01 20:50:07,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:07,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:07,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:07,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:50:07,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:08,965 INFO L134 CoverageAnalysis]: Checked inductivity of 11220 backedges. 3867 proven. 6030 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2019-01-01 20:50:08,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:50:08,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:50:08,974 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:50:09,077 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2019-01-01 20:50:09,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:50:09,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:50:09,181 INFO L134 CoverageAnalysis]: Checked inductivity of 11220 backedges. 3867 proven. 6030 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2019-01-01 20:50:09,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:50:09,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-01-01 20:50:09,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-01 20:50:09,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-01 20:50:09,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-01 20:50:09,202 INFO L87 Difference]: Start difference. First operand 439 states and 445 transitions. Second operand 48 states. [2019-01-01 20:50:09,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:09,414 INFO L93 Difference]: Finished difference Result 569 states and 575 transitions. [2019-01-01 20:50:09,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-01 20:50:09,416 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 402 [2019-01-01 20:50:09,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:09,417 INFO L225 Difference]: With dead ends: 569 [2019-01-01 20:50:09,417 INFO L226 Difference]: Without dead ends: 439 [2019-01-01 20:50:09,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-01 20:50:09,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-01-01 20:50:09,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2019-01-01 20:50:09,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-01-01 20:50:09,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 444 transitions. [2019-01-01 20:50:09,431 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 444 transitions. Word has length 402 [2019-01-01 20:50:09,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:09,432 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 444 transitions. [2019-01-01 20:50:09,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-01 20:50:09,432 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 444 transitions. [2019-01-01 20:50:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-01-01 20:50:09,434 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:09,434 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 67, 46, 46, 46, 22, 22, 22, 1, 1] [2019-01-01 20:50:09,434 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:09,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:09,435 INFO L82 PathProgramCache]: Analyzing trace with hash 86147099, now seen corresponding path program 36 times [2019-01-01 20:50:09,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:09,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:09,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:09,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:50:09,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:09,947 INFO L134 CoverageAnalysis]: Checked inductivity of 11577 backedges. 4767 proven. 1808 refuted. 0 times theorem prover too weak. 5002 trivial. 0 not checked. [2019-01-01 20:50:09,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:50:09,948 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:50:09,960 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:50:10,178 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 45 check-sat command(s) [2019-01-01 20:50:10,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:50:10,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:50:10,267 INFO L134 CoverageAnalysis]: Checked inductivity of 11577 backedges. 4139 proven. 1408 refuted. 0 times theorem prover too weak. 6030 trivial. 0 not checked. [2019-01-01 20:50:10,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:50:10,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24] total 28 [2019-01-01 20:50:10,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-01 20:50:10,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-01 20:50:10,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-01-01 20:50:10,287 INFO L87 Difference]: Start difference. First operand 439 states and 444 transitions. Second operand 29 states. [2019-01-01 20:50:10,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:10,423 INFO L93 Difference]: Finished difference Result 471 states and 480 transitions. [2019-01-01 20:50:10,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-01 20:50:10,426 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 408 [2019-01-01 20:50:10,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:10,427 INFO L225 Difference]: With dead ends: 471 [2019-01-01 20:50:10,427 INFO L226 Difference]: Without dead ends: 470 [2019-01-01 20:50:10,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-01-01 20:50:10,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-01-01 20:50:10,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 469. [2019-01-01 20:50:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-01-01 20:50:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 474 transitions. [2019-01-01 20:50:10,444 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 474 transitions. Word has length 408 [2019-01-01 20:50:10,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:10,444 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 474 transitions. [2019-01-01 20:50:10,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-01 20:50:10,444 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 474 transitions. [2019-01-01 20:50:10,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2019-01-01 20:50:10,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:10,447 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 72, 46, 46, 46, 27, 27, 27, 1, 1] [2019-01-01 20:50:10,447 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:10,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:10,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1286756710, now seen corresponding path program 37 times [2019-01-01 20:50:10,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:10,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:10,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:10,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:50:10,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 13212 backedges. 4882 proven. 6302 refuted. 0 times theorem prover too weak. 2028 trivial. 0 not checked. [2019-01-01 20:50:11,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:50:11,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:50:11,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:50:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:11,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:50:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 13212 backedges. 4882 proven. 6302 refuted. 0 times theorem prover too weak. 2028 trivial. 0 not checked. [2019-01-01 20:50:11,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:50:11,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2019-01-01 20:50:11,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-01 20:50:11,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-01 20:50:11,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-01-01 20:50:11,663 INFO L87 Difference]: Start difference. First operand 469 states and 474 transitions. Second operand 49 states. [2019-01-01 20:50:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:11,899 INFO L93 Difference]: Finished difference Result 629 states and 634 transitions. [2019-01-01 20:50:11,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-01 20:50:11,901 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 438 [2019-01-01 20:50:11,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:11,902 INFO L225 Difference]: With dead ends: 629 [2019-01-01 20:50:11,902 INFO L226 Difference]: Without dead ends: 469 [2019-01-01 20:50:11,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-01-01 20:50:11,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-01-01 20:50:11,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2019-01-01 20:50:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-01-01 20:50:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 473 transitions. [2019-01-01 20:50:11,918 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 473 transitions. Word has length 438 [2019-01-01 20:50:11,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:11,919 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 473 transitions. [2019-01-01 20:50:11,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-01 20:50:11,919 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 473 transitions. [2019-01-01 20:50:11,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-01-01 20:50:11,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:11,921 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 73, 47, 47, 47, 27, 27, 27, 1, 1] [2019-01-01 20:50:11,922 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:11,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:11,922 INFO L82 PathProgramCache]: Analyzing trace with hash -116636525, now seen corresponding path program 38 times [2019-01-01 20:50:11,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:11,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:11,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:11,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:50:11,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 13595 backedges. 4987 proven. 6580 refuted. 0 times theorem prover too weak. 2028 trivial. 0 not checked. [2019-01-01 20:50:13,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:50:13,315 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:50:13,325 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:50:13,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:50:13,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:50:13,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:50:13,535 INFO L134 CoverageAnalysis]: Checked inductivity of 13595 backedges. 4987 proven. 6580 refuted. 0 times theorem prover too weak. 2028 trivial. 0 not checked. [2019-01-01 20:50:13,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:50:13,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2019-01-01 20:50:13,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-01 20:50:13,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-01 20:50:13,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-01 20:50:13,556 INFO L87 Difference]: Start difference. First operand 469 states and 473 transitions. Second operand 50 states. [2019-01-01 20:50:13,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:13,778 INFO L93 Difference]: Finished difference Result 629 states and 633 transitions. [2019-01-01 20:50:13,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-01 20:50:13,780 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 444 [2019-01-01 20:50:13,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:13,781 INFO L225 Difference]: With dead ends: 629 [2019-01-01 20:50:13,781 INFO L226 Difference]: Without dead ends: 469 [2019-01-01 20:50:13,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-01 20:50:13,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-01-01 20:50:13,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2019-01-01 20:50:13,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-01-01 20:50:13,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 472 transitions. [2019-01-01 20:50:13,798 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 472 transitions. Word has length 444 [2019-01-01 20:50:13,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:13,798 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 472 transitions. [2019-01-01 20:50:13,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-01 20:50:13,798 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 472 transitions. [2019-01-01 20:50:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2019-01-01 20:50:13,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:13,800 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 74, 48, 48, 48, 27, 27, 27, 1, 1] [2019-01-01 20:50:13,801 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:13,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:13,801 INFO L82 PathProgramCache]: Analyzing trace with hash 512803788, now seen corresponding path program 39 times [2019-01-01 20:50:13,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:13,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:13,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:13,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:50:13,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:14,902 INFO L134 CoverageAnalysis]: Checked inductivity of 13984 backedges. 5092 proven. 6864 refuted. 0 times theorem prover too weak. 2028 trivial. 0 not checked. [2019-01-01 20:50:14,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:50:14,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:50:14,913 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:50:14,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-01 20:50:14,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:50:14,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:50:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 13984 backedges. 5438 proven. 2244 refuted. 0 times theorem prover too weak. 6302 trivial. 0 not checked. [2019-01-01 20:50:16,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:50:16,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 30] total 80 [2019-01-01 20:50:16,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-01 20:50:16,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-01 20:50:16,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-01 20:50:16,500 INFO L87 Difference]: Start difference. First operand 469 states and 472 transitions. Second operand 80 states. [2019-01-01 20:50:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:17,188 INFO L93 Difference]: Finished difference Result 642 states and 647 transitions. [2019-01-01 20:50:17,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-01 20:50:17,191 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 450 [2019-01-01 20:50:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:17,192 INFO L225 Difference]: With dead ends: 642 [2019-01-01 20:50:17,192 INFO L226 Difference]: Without dead ends: 482 [2019-01-01 20:50:17,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-01 20:50:17,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-01-01 20:50:17,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 481. [2019-01-01 20:50:17,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-01 20:50:17,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 482 transitions. [2019-01-01 20:50:17,211 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 482 transitions. Word has length 450 [2019-01-01 20:50:17,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:17,211 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 482 transitions. [2019-01-01 20:50:17,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-01 20:50:17,212 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 482 transitions. [2019-01-01 20:50:17,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2019-01-01 20:50:17,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:17,214 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 78, 50, 50, 50, 29, 29, 29, 1, 1] [2019-01-01 20:50:17,214 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:17,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:17,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1212403620, now seen corresponding path program 40 times [2019-01-01 20:50:17,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:17,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:17,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:17,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:50:17,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:18,763 INFO L134 CoverageAnalysis]: Checked inductivity of 15508 backedges. 5706 proven. 7450 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2019-01-01 20:50:18,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:50:18,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:50:18,776 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:50:18,870 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:50:18,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:50:18,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:50:19,005 INFO L134 CoverageAnalysis]: Checked inductivity of 15508 backedges. 5706 proven. 7450 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2019-01-01 20:50:19,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:50:19,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-01-01 20:50:19,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-01 20:50:19,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-01 20:50:19,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-01-01 20:50:19,026 INFO L87 Difference]: Start difference. First operand 481 states and 482 transitions. Second operand 53 states. [2019-01-01 20:50:19,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:19,330 INFO L93 Difference]: Finished difference Result 653 states and 654 transitions. [2019-01-01 20:50:19,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-01 20:50:19,334 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 474 [2019-01-01 20:50:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:19,335 INFO L225 Difference]: With dead ends: 653 [2019-01-01 20:50:19,335 INFO L226 Difference]: Without dead ends: 481 [2019-01-01 20:50:19,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-01-01 20:50:19,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-01-01 20:50:19,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2019-01-01 20:50:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-01 20:50:19,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 481 transitions. [2019-01-01 20:50:19,355 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 481 transitions. Word has length 474 [2019-01-01 20:50:19,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:19,355 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 481 transitions. [2019-01-01 20:50:19,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-01 20:50:19,355 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 481 transitions. [2019-01-01 20:50:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-01-01 20:50:19,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:19,358 INFO L402 BasicCegarLoop]: trace histogram [80, 79, 79, 51, 51, 51, 29, 29, 29, 1, 1] [2019-01-01 20:50:19,358 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:19,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:19,359 INFO L82 PathProgramCache]: Analyzing trace with hash 301245725, now seen corresponding path program 41 times [2019-01-01 20:50:19,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:19,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:19,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:19,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:50:19,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:19,962 INFO L134 CoverageAnalysis]: Checked inductivity of 15923 backedges. 6503 proven. 2840 refuted. 0 times theorem prover too weak. 6580 trivial. 0 not checked. [2019-01-01 20:50:19,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:50:19,962 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:50:19,974 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:50:20,146 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) [2019-01-01 20:50:20,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:50:20,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:50:21,894 INFO L134 CoverageAnalysis]: Checked inductivity of 15923 backedges. 3110 proven. 12629 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-01-01 20:50:21,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:50:21,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 73] total 73 [2019-01-01 20:50:21,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-01 20:50:21,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-01 20:50:21,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-01 20:50:21,915 INFO L87 Difference]: Start difference. First operand 481 states and 481 transitions. Second operand 74 states. [2019-01-01 20:50:22,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:22,324 INFO L93 Difference]: Finished difference Result 741 states and 783 transitions. [2019-01-01 20:50:22,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-01 20:50:22,327 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 480 [2019-01-01 20:50:22,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:22,329 INFO L225 Difference]: With dead ends: 741 [2019-01-01 20:50:22,329 INFO L226 Difference]: Without dead ends: 740 [2019-01-01 20:50:22,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-01 20:50:22,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-01-01 20:50:22,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 739. [2019-01-01 20:50:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-01-01 20:50:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 739 transitions. [2019-01-01 20:50:22,370 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 739 transitions. Word has length 480 [2019-01-01 20:50:22,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:22,371 INFO L480 AbstractCegarLoop]: Abstraction has 739 states and 739 transitions. [2019-01-01 20:50:22,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-01 20:50:22,371 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 739 transitions. [2019-01-01 20:50:22,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 739 [2019-01-01 20:50:22,376 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:50:22,376 INFO L402 BasicCegarLoop]: trace histogram [123, 122, 122, 72, 72, 72, 51, 51, 51, 1, 1] [2019-01-01 20:50:22,377 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:50:22,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:50:22,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1396009326, now seen corresponding path program 42 times [2019-01-01 20:50:22,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:50:22,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:50:22,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:22,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:50:22,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:50:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:50:24,314 INFO L134 CoverageAnalysis]: Checked inductivity of 37552 backedges. 24598 proven. 12752 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-01-01 20:50:24,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:50:24,315 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:50:24,327 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:50:24,567 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2019-01-01 20:50:24,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:50:24,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:50:25,125 INFO L134 CoverageAnalysis]: Checked inductivity of 37552 backedges. 24598 proven. 12752 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-01-01 20:50:25,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:50:25,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2019-01-01 20:50:25,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-01 20:50:25,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-01 20:50:25,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-01 20:50:25,147 INFO L87 Difference]: Start difference. First operand 739 states and 739 transitions. Second operand 74 states. [2019-01-01 20:50:26,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:50:26,245 INFO L93 Difference]: Finished difference Result 739 states and 739 transitions. [2019-01-01 20:50:26,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-01 20:50:26,247 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 738 [2019-01-01 20:50:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:50:26,248 INFO L225 Difference]: With dead ends: 739 [2019-01-01 20:50:26,248 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 20:50:26,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 861 GetRequests, 789 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2040 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-01 20:50:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 20:50:26,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 20:50:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 20:50:26,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 20:50:26,250 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 738 [2019-01-01 20:50:26,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:50:26,250 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 20:50:26,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-01 20:50:26,250 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 20:50:26,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 20:50:26,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-01 20:50:27,213 WARN L181 SmtUtils]: Spent 942.00 ms on a formula simplification. DAG size of input: 784 DAG size of output: 471 [2019-01-01 20:50:33,887 WARN L181 SmtUtils]: Spent 6.64 s on a formula simplification. DAG size of input: 461 DAG size of output: 415 [2019-01-01 20:50:33,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-01 20:50:33,895 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. [2019-01-01 20:50:33,895 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 23) no Hoare annotation was computed. [2019-01-01 20:50:33,895 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-01-01 20:50:33,895 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:50:33,895 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-01-01 20:50:33,895 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-01 20:50:33,895 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-01 20:50:33,895 INFO L451 ceAbstractionStarter]: At program point L26(lines 14 27) the Hoare annotation is: true [2019-01-01 20:50:33,896 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-01-01 20:50:33,896 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-01 20:50:33,896 INFO L448 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2019-01-01 20:50:33,896 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-01 20:50:33,896 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-01-01 20:50:33,906 INFO L444 ceAbstractionStarter]: At program point L18-2(lines 18 25) the Hoare annotation is: (let ((.cse48 (<= ULTIMATE.start_main_~y~0 33)) (.cse15 (<= 51 ULTIMATE.start_main_~x~0))) (let ((.cse10 (<= ULTIMATE.start_main_~y~0 4)) (.cse27 (<= ULTIMATE.start_main_~y~0 36)) (.cse0 (<= ULTIMATE.start_main_~y~0 29)) (.cse17 (<= ULTIMATE.start_main_~y~0 28)) (.cse22 (<= ULTIMATE.start_main_~y~0 22)) (.cse34 (<= ULTIMATE.start_main_~y~0 25)) (.cse28 (<= ULTIMATE.start_main_~y~0 2)) (.cse1 (<= ULTIMATE.start_main_~y~0 5)) (.cse12 (<= ULTIMATE.start_main_~y~0 24)) (.cse35 (<= ULTIMATE.start_main_~y~0 20)) (.cse14 (<= ULTIMATE.start_main_~y~0 39)) (.cse7 (<= ULTIMATE.start_main_~y~0 12)) (.cse21 (<= ULTIMATE.start_main_~y~0 31)) (.cse2 (<= ULTIMATE.start_main_~y~0 37)) (.cse16 (<= ULTIMATE.start_main_~y~0 0)) (.cse5 (<= ULTIMATE.start_main_~y~0 18)) (.cse42 (<= ULTIMATE.start_main_~y~0 32)) (.cse6 (<= ULTIMATE.start_main_~y~0 17)) (.cse4 (<= ULTIMATE.start_main_~y~0 9)) (.cse41 (<= ULTIMATE.start_main_~y~0 11)) (.cse30 (<= ULTIMATE.start_main_~y~0 47)) (.cse13 (<= ULTIMATE.start_main_~y~0 14)) (.cse24 (<= ULTIMATE.start_main_~y~0 40)) (.cse39 (<= ULTIMATE.start_main_~y~0 3)) (.cse33 (<= ULTIMATE.start_main_~y~0 1)) (.cse19 (<= ULTIMATE.start_main_~y~0 23)) (.cse44 (<= ULTIMATE.start_main_~y~0 16)) (.cse49 (<= ULTIMATE.start_main_~y~0 35)) (.cse8 (<= ULTIMATE.start_main_~y~0 21)) (.cse50 (<= ULTIMATE.start_main_~y~0 43)) (.cse45 (<= ULTIMATE.start_main_~y~0 50)) (.cse53 (<= ULTIMATE.start_main_~y~0 26)) (.cse20 (<= ULTIMATE.start_main_~y~0 38)) (.cse26 (<= ULTIMATE.start_main_~x~0 50)) (.cse32 (<= ULTIMATE.start_main_~y~0 49)) (.cse38 (<= ULTIMATE.start_main_~y~0 6)) (.cse11 (<= ULTIMATE.start_main_~y~0 42)) (.cse43 (<= ULTIMATE.start_main_~y~0 46)) (.cse51 (<= ULTIMATE.start_main_~y~0 15)) (.cse40 (<= ULTIMATE.start_main_~y~0 45)) (.cse23 (<= ULTIMATE.start_main_~x~0 51)) (.cse54 (<= ULTIMATE.start_main_~y~0 48)) (.cse46 (<= ULTIMATE.start_main_~y~0 13)) (.cse18 (<= ULTIMATE.start_main_~y~0 34)) (.cse29 (<= ULTIMATE.start_main_~y~0 19)) (.cse31 (<= ULTIMATE.start_main_~y~0 44)) (.cse37 (<= ULTIMATE.start_main_~y~0 27)) (.cse47 (<= ULTIMATE.start_main_~y~0 30)) (.cse36 (<= ULTIMATE.start_main_~y~0 41)) (.cse25 (<= ULTIMATE.start_main_~y~0 7)) (.cse9 (<= ULTIMATE.start_main_~y~0 10)) (.cse3 (and .cse48 .cse15)) (.cse52 (<= ULTIMATE.start_main_~y~0 8))) (or (and (<= 29 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 29) .cse0) (and .cse1 (<= 5 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 5)) (and (<= 37 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 37) .cse2) (and .cse3 .cse4 (<= ULTIMATE.start_main_~x~0 93)) (and .cse3 .cse5 (<= ULTIMATE.start_main_~x~0 84)) (and (<= 17 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 17) .cse6) (and (<= ULTIMATE.start_main_~x~0 12) (<= 12 ULTIMATE.start_main_~x~0) .cse7) (and .cse8 (<= 21 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 21)) (and (<= 10 ULTIMATE.start_main_~x~0) .cse9 (<= ULTIMATE.start_main_~x~0 10)) (and .cse3 .cse10 (<= ULTIMATE.start_main_~x~0 98)) (and (<= ULTIMATE.start_main_~x~0 42) (<= 42 ULTIMATE.start_main_~x~0) .cse11) (and (<= ULTIMATE.start_main_~x~0 4) .cse10 (<= 4 ULTIMATE.start_main_~x~0)) (and .cse3 (<= ULTIMATE.start_main_~x~0 78) .cse12) (and .cse13 (<= 14 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 14)) (and .cse14 .cse15 (<= ULTIMATE.start_main_~x~0 63)) (and .cse3 .cse16 (<= ULTIMATE.start_main_~x~0 102)) (and (<= 28 ULTIMATE.start_main_~x~0) .cse17 (<= ULTIMATE.start_main_~x~0 28)) (and (<= ULTIMATE.start_main_~x~0 34) .cse18 (<= 34 ULTIMATE.start_main_~x~0)) (and (<= 23 ULTIMATE.start_main_~x~0) .cse19 (<= ULTIMATE.start_main_~x~0 23)) (and .cse3 (<= ULTIMATE.start_main_~x~0 69)) (and (<= ULTIMATE.start_main_~x~0 64) .cse15 .cse20) (and (<= 31 ULTIMATE.start_main_~x~0) .cse21 (<= ULTIMATE.start_main_~x~0 31)) (and .cse22 (<= 22 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 22)) (and .cse23 (<= ULTIMATE.start_main_~y~0 51) .cse15) (and .cse24 (<= ULTIMATE.start_main_~x~0 62) .cse15) (and (<= 7 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 7) .cse25) (and .cse26 (<= 36 ULTIMATE.start_main_~x~0) .cse27) (and .cse3 .cse28 (<= ULTIMATE.start_main_~x~0 100)) (and (<= 19 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 19) .cse29) (and (<= ULTIMATE.start_main_~x~0 66) .cse15 .cse27) (and (<= ULTIMATE.start_main_~x~0 47) (<= 47 ULTIMATE.start_main_~x~0) .cse30) (and (<= ULTIMATE.start_main_~x~0 58) .cse15 .cse31) (and .cse3 (<= ULTIMATE.start_main_~x~0 73) .cse0) (and (<= ULTIMATE.start_main_~x~0 53) .cse15 .cse32) (and .cse3 (<= ULTIMATE.start_main_~x~0 74) .cse17) (and .cse33 (<= 1 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 1)) (and .cse26 (<= 25 ULTIMATE.start_main_~x~0) .cse34) (and .cse3 .cse22 (<= ULTIMATE.start_main_~x~0 80)) (and .cse3 (<= ULTIMATE.start_main_~x~0 77) .cse34) (and (<= ULTIMATE.start_main_~x~0 103) .cse3 (<= (+ ULTIMATE.start_main_~y~0 1) 0)) (and .cse28 (<= ULTIMATE.start_main_~x~0 2) (<= 2 ULTIMATE.start_main_~x~0)) (and (<= ULTIMATE.start_main_~x~0 20) .cse35 (<= 20 ULTIMATE.start_main_~x~0)) (and (<= ULTIMATE.start_main_~x~0 41) .cse36 (<= 41 ULTIMATE.start_main_~x~0)) (and .cse3 .cse37 (<= ULTIMATE.start_main_~x~0 75)) (and .cse1 .cse3 (<= ULTIMATE.start_main_~x~0 97)) (and (<= 24 ULTIMATE.start_main_~x~0) .cse12 (<= ULTIMATE.start_main_~x~0 24)) (and .cse3 .cse35 (<= ULTIMATE.start_main_~x~0 82)) (and (<= ULTIMATE.start_main_~x~0 39) (<= 39 ULTIMATE.start_main_~x~0) .cse14) (and .cse3 (<= ULTIMATE.start_main_~x~0 96) .cse38) (and (<= ULTIMATE.start_main_~x~0 90) .cse3 .cse7) (and .cse3 (<= ULTIMATE.start_main_~x~0 71) .cse21) (and .cse26 .cse39 (<= 3 ULTIMATE.start_main_~x~0)) (and (<= 45 ULTIMATE.start_main_~x~0) .cse40 (<= ULTIMATE.start_main_~x~0 45)) (and (<= ULTIMATE.start_main_~x~0 65) .cse2 .cse15) (and .cse41 (<= ULTIMATE.start_main_~x~0 11) (<= 11 ULTIMATE.start_main_~x~0)) (and (<= 32 ULTIMATE.start_main_~x~0) .cse42 (<= ULTIMATE.start_main_~x~0 32)) (and .cse43 (<= ULTIMATE.start_main_~x~0 56) .cse15) (and .cse16 (<= ULTIMATE.start_main_~x~0 0) (<= 0 ULTIMATE.start_main_~x~0) (<= 0 ULTIMATE.start_main_~y~0)) (and (<= 18 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 18) .cse5) (and .cse3 .cse44 (<= ULTIMATE.start_main_~x~0 86)) (and .cse26 (<= 50 ULTIMATE.start_main_~x~0) .cse45) (and .cse46 (<= ULTIMATE.start_main_~x~0 13) (<= 13 ULTIMATE.start_main_~x~0)) (and (<= ULTIMATE.start_main_~x~0 70) .cse3 .cse42) (and .cse3 (<= ULTIMATE.start_main_~x~0 85) .cse6) (and (<= ULTIMATE.start_main_~x~0 30) (<= 30 ULTIMATE.start_main_~x~0) .cse47) (and (<= 33 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 33) .cse48) (and .cse4 (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0)) (and .cse3 .cse41 (<= ULTIMATE.start_main_~x~0 91)) (and .cse30 .cse15 (<= ULTIMATE.start_main_~x~0 55)) (and .cse3 (<= ULTIMATE.start_main_~x~0 88) .cse13) (and .cse24 (<= 40 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 40)) (and .cse23 .cse49 (<= 35 ULTIMATE.start_main_~x~0)) (and (<= 43 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 43) .cse50) (and .cse3 .cse39 (<= ULTIMATE.start_main_~x~0 99)) (and .cse3 (<= ULTIMATE.start_main_~x~0 87) .cse51) (and .cse3 .cse33 (<= ULTIMATE.start_main_~x~0 101)) (and (<= ULTIMATE.start_main_~x~0 8) .cse52 (<= 8 ULTIMATE.start_main_~x~0)) (and .cse3 (<= ULTIMATE.start_main_~x~0 76) .cse53) (and .cse3 .cse19 (<= ULTIMATE.start_main_~x~0 79)) (and (<= ULTIMATE.start_main_~x~0 16) .cse44 (<= 16 ULTIMATE.start_main_~x~0)) (and (<= ULTIMATE.start_main_~x~0 67) .cse49 .cse15) (and .cse3 (<= ULTIMATE.start_main_~x~0 81) .cse8) (and .cse15 .cse50 (<= ULTIMATE.start_main_~x~0 59)) (and .cse45 .cse15 (<= ULTIMATE.start_main_~x~0 52)) (and (<= 26 ULTIMATE.start_main_~x~0) .cse53 (<= ULTIMATE.start_main_~x~0 26)) (and .cse23 (<= 38 ULTIMATE.start_main_~x~0) .cse20) (and .cse26 (<= 49 ULTIMATE.start_main_~x~0) .cse32) (and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6) .cse38) (and (<= ULTIMATE.start_main_~x~0 60) .cse15 .cse11) (and .cse43 (<= ULTIMATE.start_main_~x~0 46) (<= 46 ULTIMATE.start_main_~x~0)) (and .cse23 (<= 15 ULTIMATE.start_main_~x~0) .cse51) (and (<= ULTIMATE.start_main_~x~0 57) .cse15 .cse40) (and .cse23 (<= 48 ULTIMATE.start_main_~x~0) .cse54) (and .cse15 .cse54 (<= ULTIMATE.start_main_~x~0 54)) (and .cse3 .cse46 (<= ULTIMATE.start_main_~x~0 89)) (and .cse18 (<= ULTIMATE.start_main_~x~0 68) .cse15) (and .cse3 (<= ULTIMATE.start_main_~x~0 83) .cse29) (and .cse31 (<= 44 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 44)) (and .cse37 (<= ULTIMATE.start_main_~x~0 27) (<= 27 ULTIMATE.start_main_~x~0)) (and .cse3 .cse47 (<= ULTIMATE.start_main_~x~0 72)) (and (<= ULTIMATE.start_main_~x~0 61) .cse36 .cse15) (and .cse3 (<= ULTIMATE.start_main_~x~0 95) .cse25) (and (<= ULTIMATE.start_main_~x~0 92) .cse3 .cse9) (and .cse3 (<= ULTIMATE.start_main_~x~0 94) .cse52)))) [2019-01-01 20:50:33,906 INFO L448 ceAbstractionStarter]: For program point L18-3(lines 18 25) no Hoare annotation was computed. [2019-01-01 20:50:33,906 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-01-01 20:50:33,906 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-01-01 20:50:33,906 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:50:33,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:50:33 BoogieIcfgContainer [2019-01-01 20:50:33,969 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:50:33,969 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:50:33,970 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:50:33,974 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:50:33,976 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:48:01" (3/4) ... [2019-01-01 20:50:33,982 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 20:50:34,000 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 20:50:34,000 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 20:50:34,043 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:50:34,043 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:50:34,046 INFO L168 Benchmark]: Toolchain (without parser) took 153405.59 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -303.4 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-01-01 20:50:34,048 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:50:34,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.45 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 20:50:34,049 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.09 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:50:34,049 INFO L168 Benchmark]: Boogie Preprocessor took 32.89 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:50:34,049 INFO L168 Benchmark]: RCFGBuilder took 481.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-01-01 20:50:34,049 INFO L168 Benchmark]: TraceAbstraction took 152453.11 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -156.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-01-01 20:50:34,055 INFO L168 Benchmark]: Witness Printer took 73.49 ms. Allocated memory is still 2.8 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:50:34,060 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 316.45 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 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 43.09 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.89 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 481.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 152453.11 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -156.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 73.49 ms. Allocated memory is still 2.8 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((29 <= x && x <= 29) && y <= 29) || ((y <= 5 && 5 <= x) && x <= 5)) || ((37 <= x && x <= 37) && y <= 37)) || (((y <= 33 && 51 <= x) && y <= 9) && x <= 93)) || (((y <= 33 && 51 <= x) && y <= 18) && x <= 84)) || ((17 <= x && x <= 17) && y <= 17)) || ((x <= 12 && 12 <= x) && y <= 12)) || ((y <= 21 && 21 <= x) && x <= 21)) || ((10 <= x && y <= 10) && x <= 10)) || (((y <= 33 && 51 <= x) && y <= 4) && x <= 98)) || ((x <= 42 && 42 <= x) && y <= 42)) || ((x <= 4 && y <= 4) && 4 <= x)) || (((y <= 33 && 51 <= x) && x <= 78) && y <= 24)) || ((y <= 14 && 14 <= x) && x <= 14)) || ((y <= 39 && 51 <= x) && x <= 63)) || (((y <= 33 && 51 <= x) && y <= 0) && x <= 102)) || ((28 <= x && y <= 28) && x <= 28)) || ((x <= 34 && y <= 34) && 34 <= x)) || ((23 <= x && y <= 23) && x <= 23)) || ((y <= 33 && 51 <= x) && x <= 69)) || ((x <= 64 && 51 <= x) && y <= 38)) || ((31 <= x && y <= 31) && x <= 31)) || ((y <= 22 && 22 <= x) && x <= 22)) || ((x <= 51 && y <= 51) && 51 <= x)) || ((y <= 40 && x <= 62) && 51 <= x)) || ((7 <= x && x <= 7) && y <= 7)) || ((x <= 50 && 36 <= x) && y <= 36)) || (((y <= 33 && 51 <= x) && y <= 2) && x <= 100)) || ((19 <= x && x <= 19) && y <= 19)) || ((x <= 66 && 51 <= x) && y <= 36)) || ((x <= 47 && 47 <= x) && y <= 47)) || ((x <= 58 && 51 <= x) && y <= 44)) || (((y <= 33 && 51 <= x) && x <= 73) && y <= 29)) || ((x <= 53 && 51 <= x) && y <= 49)) || (((y <= 33 && 51 <= x) && x <= 74) && y <= 28)) || ((y <= 1 && 1 <= x) && x <= 1)) || ((x <= 50 && 25 <= x) && y <= 25)) || (((y <= 33 && 51 <= x) && y <= 22) && x <= 80)) || (((y <= 33 && 51 <= x) && x <= 77) && y <= 25)) || ((x <= 103 && y <= 33 && 51 <= x) && y + 1 <= 0)) || ((y <= 2 && x <= 2) && 2 <= x)) || ((x <= 20 && y <= 20) && 20 <= x)) || ((x <= 41 && y <= 41) && 41 <= x)) || (((y <= 33 && 51 <= x) && y <= 27) && x <= 75)) || ((y <= 5 && y <= 33 && 51 <= x) && x <= 97)) || ((24 <= x && y <= 24) && x <= 24)) || (((y <= 33 && 51 <= x) && y <= 20) && x <= 82)) || ((x <= 39 && 39 <= x) && y <= 39)) || (((y <= 33 && 51 <= x) && x <= 96) && y <= 6)) || ((x <= 90 && y <= 33 && 51 <= x) && y <= 12)) || (((y <= 33 && 51 <= x) && x <= 71) && y <= 31)) || ((x <= 50 && y <= 3) && 3 <= x)) || ((45 <= x && y <= 45) && x <= 45)) || ((x <= 65 && y <= 37) && 51 <= x)) || ((y <= 11 && x <= 11) && 11 <= x)) || ((32 <= x && y <= 32) && x <= 32)) || ((y <= 46 && x <= 56) && 51 <= x)) || (((y <= 0 && x <= 0) && 0 <= x) && 0 <= y)) || ((18 <= x && x <= 18) && y <= 18)) || (((y <= 33 && 51 <= x) && y <= 16) && x <= 86)) || ((x <= 50 && 50 <= x) && y <= 50)) || ((y <= 13 && x <= 13) && 13 <= x)) || ((x <= 70 && y <= 33 && 51 <= x) && y <= 32)) || (((y <= 33 && 51 <= x) && x <= 85) && y <= 17)) || ((x <= 30 && 30 <= x) && y <= 30)) || ((33 <= x && x <= 33) && y <= 33)) || ((y <= 9 && x <= 9) && 9 <= x)) || (((y <= 33 && 51 <= x) && y <= 11) && x <= 91)) || ((y <= 47 && 51 <= x) && x <= 55)) || (((y <= 33 && 51 <= x) && x <= 88) && y <= 14)) || ((y <= 40 && 40 <= x) && x <= 40)) || ((x <= 51 && y <= 35) && 35 <= x)) || ((43 <= x && x <= 43) && y <= 43)) || (((y <= 33 && 51 <= x) && y <= 3) && x <= 99)) || (((y <= 33 && 51 <= x) && x <= 87) && y <= 15)) || (((y <= 33 && 51 <= x) && y <= 1) && x <= 101)) || ((x <= 8 && y <= 8) && 8 <= x)) || (((y <= 33 && 51 <= x) && x <= 76) && y <= 26)) || (((y <= 33 && 51 <= x) && y <= 23) && x <= 79)) || ((x <= 16 && y <= 16) && 16 <= x)) || ((x <= 67 && y <= 35) && 51 <= x)) || (((y <= 33 && 51 <= x) && x <= 81) && y <= 21)) || ((51 <= x && y <= 43) && x <= 59)) || ((y <= 50 && 51 <= x) && x <= 52)) || ((26 <= x && y <= 26) && x <= 26)) || ((x <= 51 && 38 <= x) && y <= 38)) || ((x <= 50 && 49 <= x) && y <= 49)) || ((6 <= x && x <= 6) && y <= 6)) || ((x <= 60 && 51 <= x) && y <= 42)) || ((y <= 46 && x <= 46) && 46 <= x)) || ((x <= 51 && 15 <= x) && y <= 15)) || ((x <= 57 && 51 <= x) && y <= 45)) || ((x <= 51 && 48 <= x) && y <= 48)) || ((51 <= x && y <= 48) && x <= 54)) || (((y <= 33 && 51 <= x) && y <= 13) && x <= 89)) || ((y <= 34 && x <= 68) && 51 <= x)) || (((y <= 33 && 51 <= x) && x <= 83) && y <= 19)) || ((y <= 44 && 44 <= x) && x <= 44)) || ((y <= 27 && x <= 27) && 27 <= x)) || (((y <= 33 && 51 <= x) && y <= 30) && x <= 72)) || ((x <= 61 && y <= 41) && 51 <= x)) || (((y <= 33 && 51 <= x) && x <= 95) && y <= 7)) || ((x <= 92 && y <= 33 && 51 <= x) && y <= 10)) || (((y <= 33 && 51 <= x) && x <= 94) && y <= 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 6 error locations. SAFE Result, 152.3s OverallTime, 99 OverallIterations, 123 TraceHistogramMax, 48.3s AutomataDifference, 0.0s DeadEndRemovalTime, 7.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 2173 SDtfs, 15116 SDslu, 16560 SDs, 0 SdLazy, 29531 SolverSat, 3009 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22315 GetRequests, 19288 SyntacticMatches, 0 SemanticMatches, 3027 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18849 ImplicationChecksByTransitivity, 74.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5316occurred in iteration=81, 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: 4.1s AutomataMinimizationTime, 99 MinimizatonAttempts, 96881 StatesRemovedByMinimization, 84 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 108 NumberOfFragments, 1184 HoareAnnotationTreeSize, 2 FomulaSimplifications, 4743 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 2 FomulaSimplificationsInter, 15860 FormulaSimplificationTreeSizeReductionInter, 6.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 6.0s SatisfiabilityAnalysisTime, 77.6s InterpolantComputationTime, 39108 NumberOfCodeBlocks, 38514 NumberOfCodeBlocksAsserted, 1444 NumberOfCheckSat, 38914 ConstructedInterpolants, 0 QuantifiedInterpolants, 29220282 SizeOfPredicates, 30 NumberOfNonLiveVariables, 31833 ConjunctsInSsa, 2696 ConjunctsInUnsatCore, 194 InterpolantComputations, 6 PerfectInterpolantSequences, 313421/827686 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...