./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-random2d_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-random2d_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 932d0be5444dce6d8d9a378b61966d0cdf64a5cb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 01:29:13,565 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 01:29:13,567 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 01:29:13,579 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 01:29:13,579 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 01:29:13,581 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 01:29:13,582 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 01:29:13,584 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 01:29:13,586 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 01:29:13,587 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 01:29:13,588 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 01:29:13,589 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 01:29:13,590 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 01:29:13,591 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 01:29:13,592 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 01:29:13,593 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 01:29:13,594 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 01:29:13,596 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 01:29:13,599 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 01:29:13,600 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 01:29:13,602 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 01:29:13,603 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 01:29:13,606 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 01:29:13,607 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 01:29:13,607 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 01:29:13,608 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 01:29:13,610 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 01:29:13,611 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 01:29:13,612 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 01:29:13,613 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 01:29:13,613 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 01:29:13,614 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 01:29:13,615 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 01:29:13,615 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 01:29:13,616 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 01:29:13,617 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 01:29:13,618 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 01:29:13,639 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 01:29:13,640 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 01:29:13,641 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 01:29:13,641 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 01:29:13,642 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 01:29:13,642 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 01:29:13,642 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 01:29:13,642 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 01:29:13,642 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 01:29:13,642 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 01:29:13,643 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 01:29:13,647 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 01:29:13,647 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 01:29:13,647 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 01:29:13,647 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 01:29:13,647 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 01:29:13,648 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 01:29:13,649 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 01:29:13,649 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 01:29:13,649 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 01:29:13,649 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:29:13,649 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 01:29:13,649 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 01:29:13,650 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 01:29:13,650 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 01:29:13,650 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 01:29:13,650 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 01:29:13,650 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 -> 932d0be5444dce6d8d9a378b61966d0cdf64a5cb [2019-01-14 01:29:13,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 01:29:13,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 01:29:13,738 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 01:29:13,739 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 01:29:13,740 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 01:29:13,740 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-random2d_true-termination_true-no-overflow.c [2019-01-14 01:29:13,795 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c76b489/ad10e013ffa643d4a698692de87169b2/FLAG6a028dba2 [2019-01-14 01:29:14,226 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 01:29:14,228 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-random2d_true-termination_true-no-overflow.c [2019-01-14 01:29:14,236 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c76b489/ad10e013ffa643d4a698692de87169b2/FLAG6a028dba2 [2019-01-14 01:29:14,574 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c76b489/ad10e013ffa643d4a698692de87169b2 [2019-01-14 01:29:14,577 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 01:29:14,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 01:29:14,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 01:29:14,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 01:29:14,584 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 01:29:14,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:29:14" (1/1) ... [2019-01-14 01:29:14,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22f8ae22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:29:14, skipping insertion in model container [2019-01-14 01:29:14,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:29:14" (1/1) ... [2019-01-14 01:29:14,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 01:29:14,613 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 01:29:14,828 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:29:14,833 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 01:29:14,852 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:29:14,868 INFO L195 MainTranslator]: Completed translation [2019-01-14 01:29:14,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:29:14 WrapperNode [2019-01-14 01:29:14,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 01:29:14,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 01:29:14,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 01:29:14,870 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 01:29:14,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:29:14" (1/1) ... [2019-01-14 01:29:14,886 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:29:14" (1/1) ... [2019-01-14 01:29:14,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 01:29:14,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 01:29:14,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 01:29:14,913 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 01:29:14,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:29:14" (1/1) ... [2019-01-14 01:29:14,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:29:14" (1/1) ... [2019-01-14 01:29:14,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:29:14" (1/1) ... [2019-01-14 01:29:14,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:29:14" (1/1) ... [2019-01-14 01:29:14,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:29:14" (1/1) ... [2019-01-14 01:29:14,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:29:14" (1/1) ... [2019-01-14 01:29:14,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:29:14" (1/1) ... [2019-01-14 01:29:14,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 01:29:14,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 01:29:14,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 01:29:14,953 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 01:29:14,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:29:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:29:15,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 01:29:15,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 01:29:15,455 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 01:29:15,455 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 01:29:15,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:29:15 BoogieIcfgContainer [2019-01-14 01:29:15,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 01:29:15,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 01:29:15,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 01:29:15,460 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 01:29:15,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 01:29:14" (1/3) ... [2019-01-14 01:29:15,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe0f085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:29:15, skipping insertion in model container [2019-01-14 01:29:15,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:29:14" (2/3) ... [2019-01-14 01:29:15,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe0f085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:29:15, skipping insertion in model container [2019-01-14 01:29:15,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:29:15" (3/3) ... [2019-01-14 01:29:15,465 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-random2d_true-termination_true-no-overflow.c [2019-01-14 01:29:15,476 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 01:29:15,485 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-01-14 01:29:15,502 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-01-14 01:29:15,530 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 01:29:15,531 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 01:29:15,531 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 01:29:15,531 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 01:29:15,532 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 01:29:15,532 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 01:29:15,532 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 01:29:15,533 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 01:29:15,533 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 01:29:15,550 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-01-14 01:29:15,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-14 01:29:15,557 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:15,559 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-14 01:29:15,561 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:15,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:15,568 INFO L82 PathProgramCache]: Analyzing trace with hash 31073, now seen corresponding path program 1 times [2019-01-14 01:29:15,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:15,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:15,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:15,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:15,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:15,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:15,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:29:15,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:29:15,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:29:15,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:29:15,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:29:15,735 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2019-01-14 01:29:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:15,815 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-01-14 01:29:15,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:29:15,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-14 01:29:15,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:15,827 INFO L225 Difference]: With dead ends: 43 [2019-01-14 01:29:15,828 INFO L226 Difference]: Without dead ends: 30 [2019-01-14 01:29:15,831 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-14 01:29:15,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-14 01:29:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-01-14 01:29:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 01:29:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-01-14 01:29:15,866 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 3 [2019-01-14 01:29:15,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:15,867 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-01-14 01:29:15,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:29:15,867 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-01-14 01:29:15,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-14 01:29:15,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:15,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-14 01:29:15,868 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:15,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:15,869 INFO L82 PathProgramCache]: Analyzing trace with hash 963307, now seen corresponding path program 1 times [2019-01-14 01:29:15,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:15,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:15,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:15,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:15,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:15,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:29:15,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:29:15,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:29:15,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:29:15,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:29:15,912 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 3 states. [2019-01-14 01:29:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:15,947 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-01-14 01:29:15,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:29:15,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-14 01:29:15,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:15,949 INFO L225 Difference]: With dead ends: 29 [2019-01-14 01:29:15,949 INFO L226 Difference]: Without dead ends: 28 [2019-01-14 01:29:15,950 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-14 01:29:15,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-14 01:29:15,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-14 01:29:15,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 01:29:15,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-01-14 01:29:15,956 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 4 [2019-01-14 01:29:15,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:15,956 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-01-14 01:29:15,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:29:15,957 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-01-14 01:29:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 01:29:15,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:15,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:29:15,959 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:15,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:15,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1366845466, now seen corresponding path program 1 times [2019-01-14 01:29:15,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:15,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:15,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:15,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:15,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:16,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:16,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:29:16,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:29:16,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:29:16,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:29:16,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:29:16,027 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2019-01-14 01:29:16,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:16,100 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-01-14 01:29:16,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:29:16,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-14 01:29:16,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:16,103 INFO L225 Difference]: With dead ends: 51 [2019-01-14 01:29:16,103 INFO L226 Difference]: Without dead ends: 49 [2019-01-14 01:29:16,104 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-14 01:29:16,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-14 01:29:16,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2019-01-14 01:29:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 01:29:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2019-01-14 01:29:16,112 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 7 [2019-01-14 01:29:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:16,112 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2019-01-14 01:29:16,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:29:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2019-01-14 01:29:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 01:29:16,113 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:16,113 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-14 01:29:16,114 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:16,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:16,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1366808307, now seen corresponding path program 1 times [2019-01-14 01:29:16,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:16,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:16,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:16,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:16,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:16,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 01:29:16,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:16,201 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:29:16,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:16,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:16,374 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-14 01:29:16,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:16,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-01-14 01:29:16,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:29:16,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:29:16,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:29:16,394 INFO L87 Difference]: Start difference. First operand 43 states and 59 transitions. Second operand 6 states. [2019-01-14 01:29:16,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:16,674 INFO L93 Difference]: Finished difference Result 104 states and 142 transitions. [2019-01-14 01:29:16,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:29:16,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-01-14 01:29:16,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:16,677 INFO L225 Difference]: With dead ends: 104 [2019-01-14 01:29:16,677 INFO L226 Difference]: Without dead ends: 103 [2019-01-14 01:29:16,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:29:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-14 01:29:16,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 40. [2019-01-14 01:29:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 01:29:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2019-01-14 01:29:16,686 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 7 [2019-01-14 01:29:16,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:16,687 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2019-01-14 01:29:16,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:29:16,687 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2019-01-14 01:29:16,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 01:29:16,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:16,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:29:16,688 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:16,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:16,689 INFO L82 PathProgramCache]: Analyzing trace with hash 577463568, now seen corresponding path program 1 times [2019-01-14 01:29:16,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:16,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:16,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:16,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:16,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:16,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:29:16,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:29:16,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:29:16,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:29:16,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:29:16,738 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand 3 states. [2019-01-14 01:29:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:16,784 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2019-01-14 01:29:16,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:29:16,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 01:29:16,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:16,786 INFO L225 Difference]: With dead ends: 77 [2019-01-14 01:29:16,786 INFO L226 Difference]: Without dead ends: 75 [2019-01-14 01:29:16,787 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-14 01:29:16,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-14 01:29:16,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-01-14 01:29:16,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 01:29:16,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 106 transitions. [2019-01-14 01:29:16,798 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 106 transitions. Word has length 8 [2019-01-14 01:29:16,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:16,798 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 106 transitions. [2019-01-14 01:29:16,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:29:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 106 transitions. [2019-01-14 01:29:16,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 01:29:16,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:16,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:29:16,800 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:16,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:16,801 INFO L82 PathProgramCache]: Analyzing trace with hash 721693167, now seen corresponding path program 1 times [2019-01-14 01:29:16,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:16,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:16,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:16,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:16,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:16,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:16,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:29:16,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:29:16,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:29:16,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:29:16,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:29:16,854 INFO L87 Difference]: Start difference. First operand 71 states and 106 transitions. Second operand 3 states. [2019-01-14 01:29:16,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:16,943 INFO L93 Difference]: Finished difference Result 139 states and 211 transitions. [2019-01-14 01:29:16,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:29:16,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-14 01:29:16,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:16,946 INFO L225 Difference]: With dead ends: 139 [2019-01-14 01:29:16,946 INFO L226 Difference]: Without dead ends: 137 [2019-01-14 01:29:16,947 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-14 01:29:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-14 01:29:16,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129. [2019-01-14 01:29:16,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-14 01:29:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 195 transitions. [2019-01-14 01:29:16,965 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 195 transitions. Word has length 9 [2019-01-14 01:29:16,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:16,965 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 195 transitions. [2019-01-14 01:29:16,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:29:16,965 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 195 transitions. [2019-01-14 01:29:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 01:29:16,967 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:16,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:29:16,968 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:16,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:16,969 INFO L82 PathProgramCache]: Analyzing trace with hash 897651769, now seen corresponding path program 1 times [2019-01-14 01:29:16,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:16,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:16,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:16,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:16,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:17,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:17,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:29:17,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:29:17,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:29:17,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:29:17,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:29:17,029 INFO L87 Difference]: Start difference. First operand 129 states and 195 transitions. Second operand 3 states. [2019-01-14 01:29:17,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:17,096 INFO L93 Difference]: Finished difference Result 255 states and 389 transitions. [2019-01-14 01:29:17,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:29:17,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 01:29:17,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:17,099 INFO L225 Difference]: With dead ends: 255 [2019-01-14 01:29:17,099 INFO L226 Difference]: Without dead ends: 253 [2019-01-14 01:29:17,100 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-14 01:29:17,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-14 01:29:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 249. [2019-01-14 01:29:17,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-01-14 01:29:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 377 transitions. [2019-01-14 01:29:17,134 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 377 transitions. Word has length 10 [2019-01-14 01:29:17,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:17,136 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 377 transitions. [2019-01-14 01:29:17,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:29:17,136 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 377 transitions. [2019-01-14 01:29:17,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 01:29:17,137 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:17,137 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-14 01:29:17,138 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:17,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:17,138 INFO L82 PathProgramCache]: Analyzing trace with hash -795491305, now seen corresponding path program 1 times [2019-01-14 01:29:17,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:17,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:17,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:17,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:17,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:17,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:17,221 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:29:17,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:17,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:17,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:17,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-01-14 01:29:17,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:29:17,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:29:17,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:29:17,301 INFO L87 Difference]: Start difference. First operand 249 states and 377 transitions. Second operand 4 states. [2019-01-14 01:29:17,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:17,428 INFO L93 Difference]: Finished difference Result 449 states and 688 transitions. [2019-01-14 01:29:17,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:29:17,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-14 01:29:17,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:17,432 INFO L225 Difference]: With dead ends: 449 [2019-01-14 01:29:17,432 INFO L226 Difference]: Without dead ends: 447 [2019-01-14 01:29:17,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:29:17,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-01-14 01:29:17,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 357. [2019-01-14 01:29:17,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-01-14 01:29:17,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 543 transitions. [2019-01-14 01:29:17,462 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 543 transitions. Word has length 14 [2019-01-14 01:29:17,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:17,463 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 543 transitions. [2019-01-14 01:29:17,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:29:17,463 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 543 transitions. [2019-01-14 01:29:17,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 01:29:17,464 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:17,464 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:29:17,465 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:17,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:17,465 INFO L82 PathProgramCache]: Analyzing trace with hash 592160614, now seen corresponding path program 1 times [2019-01-14 01:29:17,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:17,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:17,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:17,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:17,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:17,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:17,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:17,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:29:17,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:17,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:17,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:17,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:29:17,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-14 01:29:17,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:29:17,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:29:17,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:29:17,604 INFO L87 Difference]: Start difference. First operand 357 states and 543 transitions. Second operand 5 states. [2019-01-14 01:29:17,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:17,755 INFO L93 Difference]: Finished difference Result 610 states and 939 transitions. [2019-01-14 01:29:17,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:29:17,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-14 01:29:17,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:17,763 INFO L225 Difference]: With dead ends: 610 [2019-01-14 01:29:17,763 INFO L226 Difference]: Without dead ends: 608 [2019-01-14 01:29:17,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:29:17,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-01-14 01:29:17,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 464. [2019-01-14 01:29:17,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-01-14 01:29:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 701 transitions. [2019-01-14 01:29:17,798 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 701 transitions. Word has length 16 [2019-01-14 01:29:17,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:17,798 INFO L480 AbstractCegarLoop]: Abstraction has 464 states and 701 transitions. [2019-01-14 01:29:17,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:29:17,799 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 701 transitions. [2019-01-14 01:29:17,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 01:29:17,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:17,800 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-14 01:29:17,801 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:17,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:17,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1222343671, now seen corresponding path program 1 times [2019-01-14 01:29:17,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:17,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:17,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:17,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:17,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:17,907 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:17,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:17,907 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-14 01:29:17,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:17,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:17,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:17,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-01-14 01:29:17,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:29:17,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:29:17,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:29:17,955 INFO L87 Difference]: Start difference. First operand 464 states and 701 transitions. Second operand 4 states. [2019-01-14 01:29:18,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:18,232 INFO L93 Difference]: Finished difference Result 834 states and 1284 transitions. [2019-01-14 01:29:18,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:29:18,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-01-14 01:29:18,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:18,240 INFO L225 Difference]: With dead ends: 834 [2019-01-14 01:29:18,240 INFO L226 Difference]: Without dead ends: 832 [2019-01-14 01:29:18,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:29:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-01-14 01:29:18,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 668. [2019-01-14 01:29:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-01-14 01:29:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1007 transitions. [2019-01-14 01:29:18,282 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 1007 transitions. Word has length 18 [2019-01-14 01:29:18,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:18,282 INFO L480 AbstractCegarLoop]: Abstraction has 668 states and 1007 transitions. [2019-01-14 01:29:18,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:29:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1007 transitions. [2019-01-14 01:29:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 01:29:18,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:18,289 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:29:18,289 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:18,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:18,290 INFO L82 PathProgramCache]: Analyzing trace with hash -668230362, now seen corresponding path program 1 times [2019-01-14 01:29:18,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:18,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:18,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:18,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:18,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:18,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:18,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:18,365 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-14 01:29:18,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:18,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:18,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:29:18,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-14 01:29:18,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:29:18,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:29:18,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:29:18,473 INFO L87 Difference]: Start difference. First operand 668 states and 1007 transitions. Second operand 5 states. [2019-01-14 01:29:18,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:18,650 INFO L93 Difference]: Finished difference Result 1139 states and 1747 transitions. [2019-01-14 01:29:18,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:29:18,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-01-14 01:29:18,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:18,664 INFO L225 Difference]: With dead ends: 1139 [2019-01-14 01:29:18,665 INFO L226 Difference]: Without dead ends: 1137 [2019-01-14 01:29:18,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:29:18,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2019-01-14 01:29:18,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 871. [2019-01-14 01:29:18,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2019-01-14 01:29:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1297 transitions. [2019-01-14 01:29:18,709 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1297 transitions. Word has length 20 [2019-01-14 01:29:18,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:18,711 INFO L480 AbstractCegarLoop]: Abstraction has 871 states and 1297 transitions. [2019-01-14 01:29:18,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:29:18,711 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1297 transitions. [2019-01-14 01:29:18,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 01:29:18,713 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:18,713 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1] [2019-01-14 01:29:18,714 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:18,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:18,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2023206598, now seen corresponding path program 2 times [2019-01-14 01:29:18,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:18,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:18,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:18,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:18,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:18,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:18,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 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-14 01:29:18,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:29:18,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:29:18,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:18,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:18,869 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:18,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:18,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-14 01:29:18,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:29:18,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:29:18,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:29:18,898 INFO L87 Difference]: Start difference. First operand 871 states and 1297 transitions. Second operand 5 states. [2019-01-14 01:29:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:19,327 INFO L93 Difference]: Finished difference Result 1504 states and 2266 transitions. [2019-01-14 01:29:19,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:29:19,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-14 01:29:19,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:19,337 INFO L225 Difference]: With dead ends: 1504 [2019-01-14 01:29:19,337 INFO L226 Difference]: Without dead ends: 1502 [2019-01-14 01:29:19,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:29:19,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2019-01-14 01:29:19,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1193. [2019-01-14 01:29:19,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2019-01-14 01:29:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1768 transitions. [2019-01-14 01:29:19,396 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1768 transitions. Word has length 21 [2019-01-14 01:29:19,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:19,402 INFO L480 AbstractCegarLoop]: Abstraction has 1193 states and 1768 transitions. [2019-01-14 01:29:19,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:29:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1768 transitions. [2019-01-14 01:29:19,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 01:29:19,403 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:19,403 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1] [2019-01-14 01:29:19,407 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:19,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:19,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1092753757, now seen corresponding path program 1 times [2019-01-14 01:29:19,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:19,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:19,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:19,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:29:19,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:19,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:19,673 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-14 01:29:19,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:19,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:19,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:19,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-14 01:29:19,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:29:19,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:29:19,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:29:19,805 INFO L87 Difference]: Start difference. First operand 1193 states and 1768 transitions. Second operand 5 states. [2019-01-14 01:29:20,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:20,287 INFO L93 Difference]: Finished difference Result 1951 states and 2902 transitions. [2019-01-14 01:29:20,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:29:20,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-01-14 01:29:20,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:20,300 INFO L225 Difference]: With dead ends: 1951 [2019-01-14 01:29:20,303 INFO L226 Difference]: Without dead ends: 1950 [2019-01-14 01:29:20,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:29:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2019-01-14 01:29:20,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1429. [2019-01-14 01:29:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2019-01-14 01:29:20,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 2114 transitions. [2019-01-14 01:29:20,383 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 2114 transitions. Word has length 25 [2019-01-14 01:29:20,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:20,383 INFO L480 AbstractCegarLoop]: Abstraction has 1429 states and 2114 transitions. [2019-01-14 01:29:20,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:29:20,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2114 transitions. [2019-01-14 01:29:20,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 01:29:20,385 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:20,386 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1] [2019-01-14 01:29:20,387 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:20,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:20,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1883170607, now seen corresponding path program 2 times [2019-01-14 01:29:20,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:20,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:20,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:20,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:20,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:20,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:20,534 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-14 01:29:20,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:29:20,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:29:20,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:20,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:20,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:20,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-14 01:29:20,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:29:20,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:29:20,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:29:20,613 INFO L87 Difference]: Start difference. First operand 1429 states and 2114 transitions. Second operand 5 states. [2019-01-14 01:29:21,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:21,052 INFO L93 Difference]: Finished difference Result 2462 states and 3693 transitions. [2019-01-14 01:29:21,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:29:21,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-01-14 01:29:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:21,068 INFO L225 Difference]: With dead ends: 2462 [2019-01-14 01:29:21,068 INFO L226 Difference]: Without dead ends: 2460 [2019-01-14 01:29:21,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-14 01:29:21,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2019-01-14 01:29:21,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 1959. [2019-01-14 01:29:21,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1959 states. [2019-01-14 01:29:21,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 2882 transitions. [2019-01-14 01:29:21,157 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 2882 transitions. Word has length 27 [2019-01-14 01:29:21,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:21,157 INFO L480 AbstractCegarLoop]: Abstraction has 1959 states and 2882 transitions. [2019-01-14 01:29:21,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:29:21,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2882 transitions. [2019-01-14 01:29:21,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 01:29:21,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:21,158 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1] [2019-01-14 01:29:21,159 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:21,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:21,159 INFO L82 PathProgramCache]: Analyzing trace with hash -748146377, now seen corresponding path program 3 times [2019-01-14 01:29:21,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:21,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:21,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:21,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:29:21,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:21,431 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:21,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:21,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 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-14 01:29:21,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:29:21,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 01:29:21,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:21,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:21,491 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:21,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:21,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 01:29:21,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:29:21,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:29:21,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:29:21,514 INFO L87 Difference]: Start difference. First operand 1959 states and 2882 transitions. Second operand 6 states. [2019-01-14 01:29:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:21,876 INFO L93 Difference]: Finished difference Result 3173 states and 4732 transitions. [2019-01-14 01:29:21,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:29:21,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-01-14 01:29:21,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:21,894 INFO L225 Difference]: With dead ends: 3173 [2019-01-14 01:29:21,894 INFO L226 Difference]: Without dead ends: 3171 [2019-01-14 01:29:21,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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-14 01:29:21,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2019-01-14 01:29:21,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 2563. [2019-01-14 01:29:21,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2563 states. [2019-01-14 01:29:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 3749 transitions. [2019-01-14 01:29:21,998 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 3749 transitions. Word has length 28 [2019-01-14 01:29:21,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:21,998 INFO L480 AbstractCegarLoop]: Abstraction has 2563 states and 3749 transitions. [2019-01-14 01:29:21,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:29:21,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 3749 transitions. [2019-01-14 01:29:22,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 01:29:22,004 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:22,004 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1] [2019-01-14 01:29:22,006 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:22,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:22,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1682870728, now seen corresponding path program 1 times [2019-01-14 01:29:22,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:22,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:22,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:22,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:29:22,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:22,252 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:22,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:22,252 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-14 01:29:22,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:22,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:22,308 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:22,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:22,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-14 01:29:22,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:29:22,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:29:22,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:29:22,339 INFO L87 Difference]: Start difference. First operand 2563 states and 3749 transitions. Second operand 5 states. [2019-01-14 01:29:22,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:22,629 INFO L93 Difference]: Finished difference Result 4182 states and 6155 transitions. [2019-01-14 01:29:22,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:29:22,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-14 01:29:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:22,649 INFO L225 Difference]: With dead ends: 4182 [2019-01-14 01:29:22,649 INFO L226 Difference]: Without dead ends: 4181 [2019-01-14 01:29:22,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:29:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4181 states. [2019-01-14 01:29:22,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 3071. [2019-01-14 01:29:22,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2019-01-14 01:29:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 4483 transitions. [2019-01-14 01:29:22,769 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 4483 transitions. Word has length 31 [2019-01-14 01:29:22,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:22,769 INFO L480 AbstractCegarLoop]: Abstraction has 3071 states and 4483 transitions. [2019-01-14 01:29:22,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:29:22,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 4483 transitions. [2019-01-14 01:29:22,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 01:29:22,771 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:22,771 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1] [2019-01-14 01:29:22,771 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:22,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:22,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1047523897, now seen corresponding path program 2 times [2019-01-14 01:29:22,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:22,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:22,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:22,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:22,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:23,120 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-14 01:29:23,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:23,120 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-14 01:29:23,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:29:23,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:29:23,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:23,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:23,190 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-14 01:29:23,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:23,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 01:29:23,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:29:23,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:29:23,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:29:23,224 INFO L87 Difference]: Start difference. First operand 3071 states and 4483 transitions. Second operand 6 states. [2019-01-14 01:29:23,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:23,533 INFO L93 Difference]: Finished difference Result 4727 states and 6947 transitions. [2019-01-14 01:29:23,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:29:23,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-01-14 01:29:23,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:23,558 INFO L225 Difference]: With dead ends: 4727 [2019-01-14 01:29:23,558 INFO L226 Difference]: Without dead ends: 4726 [2019-01-14 01:29:23,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:29:23,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4726 states. [2019-01-14 01:29:23,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4726 to 3459. [2019-01-14 01:29:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3459 states. [2019-01-14 01:29:23,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 5047 transitions. [2019-01-14 01:29:23,688 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 5047 transitions. Word has length 33 [2019-01-14 01:29:23,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:23,689 INFO L480 AbstractCegarLoop]: Abstraction has 3459 states and 5047 transitions. [2019-01-14 01:29:23,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:29:23,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 5047 transitions. [2019-01-14 01:29:23,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 01:29:23,690 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:23,690 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1] [2019-01-14 01:29:23,693 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:23,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:23,694 INFO L82 PathProgramCache]: Analyzing trace with hash -507101786, now seen corresponding path program 4 times [2019-01-14 01:29:23,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:23,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:23,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:23,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:29:23,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:23,839 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:23,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:23,839 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-14 01:29:23,851 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:29:23,899 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:29:23,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:23,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:23,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:23,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 01:29:23,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:29:23,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:29:23,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:29:23,970 INFO L87 Difference]: Start difference. First operand 3459 states and 5047 transitions. Second operand 7 states. [2019-01-14 01:29:24,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:24,344 INFO L93 Difference]: Finished difference Result 5326 states and 7884 transitions. [2019-01-14 01:29:24,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:29:24,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-01-14 01:29:24,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:24,369 INFO L225 Difference]: With dead ends: 5326 [2019-01-14 01:29:24,369 INFO L226 Difference]: Without dead ends: 5324 [2019-01-14 01:29:24,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:29:24,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5324 states. [2019-01-14 01:29:24,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5324 to 4377. [2019-01-14 01:29:24,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4377 states. [2019-01-14 01:29:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4377 states to 4377 states and 6353 transitions. [2019-01-14 01:29:24,568 INFO L78 Accepts]: Start accepts. Automaton has 4377 states and 6353 transitions. Word has length 35 [2019-01-14 01:29:24,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:24,568 INFO L480 AbstractCegarLoop]: Abstraction has 4377 states and 6353 transitions. [2019-01-14 01:29:24,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:29:24,568 INFO L276 IsEmpty]: Start isEmpty. Operand 4377 states and 6353 transitions. [2019-01-14 01:29:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 01:29:24,571 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:24,572 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1] [2019-01-14 01:29:24,573 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:24,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:24,573 INFO L82 PathProgramCache]: Analyzing trace with hash -32854327, now seen corresponding path program 3 times [2019-01-14 01:29:24,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:24,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:24,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:24,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:29:24,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:24,681 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:24,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:24,682 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-14 01:29:24,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:29:24,735 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 01:29:24,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:24,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:24,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:24,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 01:29:24,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:29:24,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:29:24,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:29:24,771 INFO L87 Difference]: Start difference. First operand 4377 states and 6353 transitions. Second operand 6 states. [2019-01-14 01:29:25,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:25,055 INFO L93 Difference]: Finished difference Result 7069 states and 10425 transitions. [2019-01-14 01:29:25,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:29:25,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-01-14 01:29:25,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:25,071 INFO L225 Difference]: With dead ends: 7069 [2019-01-14 01:29:25,071 INFO L226 Difference]: Without dead ends: 7067 [2019-01-14 01:29:25,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:29:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7067 states. [2019-01-14 01:29:25,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7067 to 5729. [2019-01-14 01:29:25,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5729 states. [2019-01-14 01:29:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5729 states to 5729 states and 8265 transitions. [2019-01-14 01:29:25,273 INFO L78 Accepts]: Start accepts. Automaton has 5729 states and 8265 transitions. Word has length 36 [2019-01-14 01:29:25,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:25,273 INFO L480 AbstractCegarLoop]: Abstraction has 5729 states and 8265 transitions. [2019-01-14 01:29:25,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:29:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 5729 states and 8265 transitions. [2019-01-14 01:29:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-14 01:29:25,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:25,275 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1] [2019-01-14 01:29:25,275 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:25,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1137071253, now seen corresponding path program 2 times [2019-01-14 01:29:25,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:25,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:25,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:25,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:29:25,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:25,391 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:25,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:25,392 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-14 01:29:25,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:29:25,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:29:25,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:25,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:25,425 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:25,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:25,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 01:29:25,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:29:25,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:29:25,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:29:25,448 INFO L87 Difference]: Start difference. First operand 5729 states and 8265 transitions. Second operand 6 states. [2019-01-14 01:29:25,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:25,680 INFO L93 Difference]: Finished difference Result 8806 states and 12809 transitions. [2019-01-14 01:29:25,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:29:25,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-01-14 01:29:25,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:25,697 INFO L225 Difference]: With dead ends: 8806 [2019-01-14 01:29:25,697 INFO L226 Difference]: Without dead ends: 8805 [2019-01-14 01:29:25,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:29:25,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8805 states. [2019-01-14 01:29:25,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8805 to 6453. [2019-01-14 01:29:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6453 states. [2019-01-14 01:29:25,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6453 states to 6453 states and 9305 transitions. [2019-01-14 01:29:25,880 INFO L78 Accepts]: Start accepts. Automaton has 6453 states and 9305 transitions. Word has length 41 [2019-01-14 01:29:25,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:25,880 INFO L480 AbstractCegarLoop]: Abstraction has 6453 states and 9305 transitions. [2019-01-14 01:29:25,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:29:25,881 INFO L276 IsEmpty]: Start isEmpty. Operand 6453 states and 9305 transitions. [2019-01-14 01:29:25,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-14 01:29:25,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:25,882 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 1, 1] [2019-01-14 01:29:25,883 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:25,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:25,883 INFO L82 PathProgramCache]: Analyzing trace with hash 589297713, now seen corresponding path program 3 times [2019-01-14 01:29:25,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:25,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:25,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:25,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:29:25,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:26,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:26,032 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-14 01:29:26,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:29:26,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-14 01:29:26,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:26,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:26,072 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:26,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:26,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 01:29:26,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:29:26,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:29:26,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:29:26,095 INFO L87 Difference]: Start difference. First operand 6453 states and 9305 transitions. Second operand 7 states. [2019-01-14 01:29:26,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:26,356 INFO L93 Difference]: Finished difference Result 9500 states and 13815 transitions. [2019-01-14 01:29:26,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:29:26,357 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-01-14 01:29:26,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:26,377 INFO L225 Difference]: With dead ends: 9500 [2019-01-14 01:29:26,377 INFO L226 Difference]: Without dead ends: 9499 [2019-01-14 01:29:26,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:29:26,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9499 states. [2019-01-14 01:29:26,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9499 to 7025. [2019-01-14 01:29:26,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7025 states. [2019-01-14 01:29:26,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7025 states to 7025 states and 10131 transitions. [2019-01-14 01:29:26,692 INFO L78 Accepts]: Start accepts. Automaton has 7025 states and 10131 transitions. Word has length 41 [2019-01-14 01:29:26,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:26,692 INFO L480 AbstractCegarLoop]: Abstraction has 7025 states and 10131 transitions. [2019-01-14 01:29:26,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:29:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 7025 states and 10131 transitions. [2019-01-14 01:29:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-14 01:29:26,694 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:26,694 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 1, 1] [2019-01-14 01:29:26,695 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:26,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:26,695 INFO L82 PathProgramCache]: Analyzing trace with hash 644163159, now seen corresponding path program 5 times [2019-01-14 01:29:26,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:26,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:26,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:26,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:29:26,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:26,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:26,811 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-14 01:29:26,822 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:29:26,838 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-14 01:29:26,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:26,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:26,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:26,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 01:29:26,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:29:26,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:29:26,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:29:26,869 INFO L87 Difference]: Start difference. First operand 7025 states and 10131 transitions. Second operand 8 states. [2019-01-14 01:29:27,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:27,090 INFO L93 Difference]: Finished difference Result 10381 states and 15206 transitions. [2019-01-14 01:29:27,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 01:29:27,090 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-01-14 01:29:27,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:27,110 INFO L225 Difference]: With dead ends: 10381 [2019-01-14 01:29:27,110 INFO L226 Difference]: Without dead ends: 10379 [2019-01-14 01:29:27,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:29:27,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10379 states. [2019-01-14 01:29:27,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10379 to 8665. [2019-01-14 01:29:27,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8665 states. [2019-01-14 01:29:27,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8665 states to 8665 states and 12438 transitions. [2019-01-14 01:29:27,469 INFO L78 Accepts]: Start accepts. Automaton has 8665 states and 12438 transitions. Word has length 42 [2019-01-14 01:29:27,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:27,470 INFO L480 AbstractCegarLoop]: Abstraction has 8665 states and 12438 transitions. [2019-01-14 01:29:27,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:29:27,470 INFO L276 IsEmpty]: Start isEmpty. Operand 8665 states and 12438 transitions. [2019-01-14 01:29:27,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 01:29:27,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:27,472 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1] [2019-01-14 01:29:27,473 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:27,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:27,473 INFO L82 PathProgramCache]: Analyzing trace with hash -809708433, now seen corresponding path program 4 times [2019-01-14 01:29:27,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:27,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:27,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:27,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:29:27,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:27,585 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:27,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:27,586 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-14 01:29:27,600 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:29:27,616 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:29:27,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:27,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:27,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:27,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 01:29:27,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:29:27,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:29:27,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:29:27,653 INFO L87 Difference]: Start difference. First operand 8665 states and 12438 transitions. Second operand 7 states. [2019-01-14 01:29:27,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:27,919 INFO L93 Difference]: Finished difference Result 13312 states and 19429 transitions. [2019-01-14 01:29:27,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:29:27,919 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-01-14 01:29:27,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:27,932 INFO L225 Difference]: With dead ends: 13312 [2019-01-14 01:29:27,932 INFO L226 Difference]: Without dead ends: 13310 [2019-01-14 01:29:27,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 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-14 01:29:27,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13310 states. [2019-01-14 01:29:28,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13310 to 10967. [2019-01-14 01:29:28,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10967 states. [2019-01-14 01:29:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10967 states to 10967 states and 15657 transitions. [2019-01-14 01:29:28,300 INFO L78 Accepts]: Start accepts. Automaton has 10967 states and 15657 transitions. Word has length 45 [2019-01-14 01:29:28,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:28,300 INFO L480 AbstractCegarLoop]: Abstraction has 10967 states and 15657 transitions. [2019-01-14 01:29:28,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:29:28,300 INFO L276 IsEmpty]: Start isEmpty. Operand 10967 states and 15657 transitions. [2019-01-14 01:29:28,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-14 01:29:28,303 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:28,303 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 1, 1] [2019-01-14 01:29:28,304 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:28,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:28,304 INFO L82 PathProgramCache]: Analyzing trace with hash -144620410, now seen corresponding path program 6 times [2019-01-14 01:29:28,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:28,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:28,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:28,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:29:28,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:28,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:28,527 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-14 01:29:28,537 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:29:28,558 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-14 01:29:28,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:28,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:28,568 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:28,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:28,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 01:29:28,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:29:28,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:29:28,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:29:28,590 INFO L87 Difference]: Start difference. First operand 10967 states and 15657 transitions. Second operand 9 states. [2019-01-14 01:29:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:28,861 INFO L93 Difference]: Finished difference Result 15622 states and 22665 transitions. [2019-01-14 01:29:28,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:29:28,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2019-01-14 01:29:28,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:28,877 INFO L225 Difference]: With dead ends: 15622 [2019-01-14 01:29:28,877 INFO L226 Difference]: Without dead ends: 15620 [2019-01-14 01:29:28,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 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-14 01:29:28,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15620 states. [2019-01-14 01:29:29,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15620 to 13091. [2019-01-14 01:29:29,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13091 states. [2019-01-14 01:29:29,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13091 states to 13091 states and 18609 transitions. [2019-01-14 01:29:29,155 INFO L78 Accepts]: Start accepts. Automaton has 13091 states and 18609 transitions. Word has length 49 [2019-01-14 01:29:29,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:29,155 INFO L480 AbstractCegarLoop]: Abstraction has 13091 states and 18609 transitions. [2019-01-14 01:29:29,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:29:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 13091 states and 18609 transitions. [2019-01-14 01:29:29,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-14 01:29:29,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:29,158 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 1, 1] [2019-01-14 01:29:29,159 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:29,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:29,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2004605083, now seen corresponding path program 4 times [2019-01-14 01:29:29,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:29,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:29,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:29,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:29:29,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:29,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:29,324 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-14 01:29:29,335 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:29:29,355 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:29:29,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:29,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:29,364 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:29,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:29,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 01:29:29,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:29:29,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:29:29,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:29:29,385 INFO L87 Difference]: Start difference. First operand 13091 states and 18609 transitions. Second operand 8 states. [2019-01-14 01:29:29,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:29,776 INFO L93 Difference]: Finished difference Result 19890 states and 28521 transitions. [2019-01-14 01:29:29,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 01:29:29,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-01-14 01:29:29,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:29,798 INFO L225 Difference]: With dead ends: 19890 [2019-01-14 01:29:29,799 INFO L226 Difference]: Without dead ends: 19889 [2019-01-14 01:29:29,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:29:29,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19889 states. [2019-01-14 01:29:30,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19889 to 14129. [2019-01-14 01:29:30,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14129 states. [2019-01-14 01:29:30,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14129 states to 14129 states and 20097 transitions. [2019-01-14 01:29:30,241 INFO L78 Accepts]: Start accepts. Automaton has 14129 states and 20097 transitions. Word has length 49 [2019-01-14 01:29:30,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:30,241 INFO L480 AbstractCegarLoop]: Abstraction has 14129 states and 20097 transitions. [2019-01-14 01:29:30,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:29:30,241 INFO L276 IsEmpty]: Start isEmpty. Operand 14129 states and 20097 transitions. [2019-01-14 01:29:30,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-14 01:29:30,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:30,244 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1] [2019-01-14 01:29:30,244 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:30,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:30,245 INFO L82 PathProgramCache]: Analyzing trace with hash -85375778, now seen corresponding path program 3 times [2019-01-14 01:29:30,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:30,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:30,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:30,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:29:30,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:30,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:30,363 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-14 01:29:30,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:29:30,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-14 01:29:30,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:30,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:30,428 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:30,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:30,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 01:29:30,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:29:30,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:29:30,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:29:30,459 INFO L87 Difference]: Start difference. First operand 14129 states and 20097 transitions. Second operand 7 states. [2019-01-14 01:29:30,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:30,940 INFO L93 Difference]: Finished difference Result 20774 states and 29837 transitions. [2019-01-14 01:29:30,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:29:30,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-01-14 01:29:30,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:30,960 INFO L225 Difference]: With dead ends: 20774 [2019-01-14 01:29:30,961 INFO L226 Difference]: Without dead ends: 20773 [2019-01-14 01:29:30,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 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-14 01:29:30,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20773 states. [2019-01-14 01:29:31,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20773 to 15381. [2019-01-14 01:29:31,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15381 states. [2019-01-14 01:29:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15381 states to 15381 states and 21881 transitions. [2019-01-14 01:29:31,352 INFO L78 Accepts]: Start accepts. Automaton has 15381 states and 21881 transitions. Word has length 51 [2019-01-14 01:29:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:31,352 INFO L480 AbstractCegarLoop]: Abstraction has 15381 states and 21881 transitions. [2019-01-14 01:29:31,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:29:31,353 INFO L276 IsEmpty]: Start isEmpty. Operand 15381 states and 21881 transitions. [2019-01-14 01:29:31,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 01:29:31,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:31,519 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1] [2019-01-14 01:29:31,520 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:31,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:31,520 INFO L82 PathProgramCache]: Analyzing trace with hash -884758135, now seen corresponding path program 5 times [2019-01-14 01:29:31,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:31,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:31,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:31,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:29:31,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:31,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:31,635 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-14 01:29:31,645 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:29:31,663 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-14 01:29:31,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:31,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:31,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:31,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 01:29:31,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:29:31,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:29:31,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:29:31,690 INFO L87 Difference]: Start difference. First operand 15381 states and 21881 transitions. Second operand 8 states. [2019-01-14 01:29:32,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:32,076 INFO L93 Difference]: Finished difference Result 22697 states and 32841 transitions. [2019-01-14 01:29:32,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 01:29:32,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-01-14 01:29:32,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:32,099 INFO L225 Difference]: With dead ends: 22697 [2019-01-14 01:29:32,100 INFO L226 Difference]: Without dead ends: 22695 [2019-01-14 01:29:32,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:29:32,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22695 states. [2019-01-14 01:29:32,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22695 to 18973. [2019-01-14 01:29:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18973 states. [2019-01-14 01:29:32,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18973 states to 18973 states and 26864 transitions. [2019-01-14 01:29:32,539 INFO L78 Accepts]: Start accepts. Automaton has 18973 states and 26864 transitions. Word has length 54 [2019-01-14 01:29:32,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:32,540 INFO L480 AbstractCegarLoop]: Abstraction has 18973 states and 26864 transitions. [2019-01-14 01:29:32,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:29:32,540 INFO L276 IsEmpty]: Start isEmpty. Operand 18973 states and 26864 transitions. [2019-01-14 01:29:32,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 01:29:32,543 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:32,543 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 1, 1] [2019-01-14 01:29:32,543 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:32,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:32,543 INFO L82 PathProgramCache]: Analyzing trace with hash -931224713, now seen corresponding path program 7 times [2019-01-14 01:29:32,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:32,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:32,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:32,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:29:32,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:33,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:33,123 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-14 01:29:33,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:33,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:33,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:33,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 01:29:33,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 01:29:33,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 01:29:33,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:29:33,208 INFO L87 Difference]: Start difference. First operand 18973 states and 26864 transitions. Second operand 10 states. [2019-01-14 01:29:33,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:33,829 INFO L93 Difference]: Finished difference Result 26251 states and 37778 transitions. [2019-01-14 01:29:33,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 01:29:33,831 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-01-14 01:29:33,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:33,871 INFO L225 Difference]: With dead ends: 26251 [2019-01-14 01:29:33,872 INFO L226 Difference]: Without dead ends: 26249 [2019-01-14 01:29:33,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:29:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26249 states. [2019-01-14 01:29:34,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26249 to 22311. [2019-01-14 01:29:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22311 states. [2019-01-14 01:29:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22311 states to 22311 states and 31473 transitions. [2019-01-14 01:29:34,634 INFO L78 Accepts]: Start accepts. Automaton has 22311 states and 31473 transitions. Word has length 56 [2019-01-14 01:29:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:34,635 INFO L480 AbstractCegarLoop]: Abstraction has 22311 states and 31473 transitions. [2019-01-14 01:29:34,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 01:29:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 22311 states and 31473 transitions. [2019-01-14 01:29:34,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 01:29:34,638 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:34,638 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 1, 1] [2019-01-14 01:29:34,639 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:34,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:34,639 INFO L82 PathProgramCache]: Analyzing trace with hash -2041729275, now seen corresponding path program 5 times [2019-01-14 01:29:34,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:34,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:34,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:34,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:34,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:34,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:34,975 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-14 01:29:34,986 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:29:35,005 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-01-14 01:29:35,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:35,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:35,013 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:35,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:35,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 01:29:35,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:29:35,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:29:35,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:29:35,033 INFO L87 Difference]: Start difference. First operand 22311 states and 31473 transitions. Second operand 9 states. [2019-01-14 01:29:35,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:35,709 INFO L93 Difference]: Finished difference Result 32955 states and 46932 transitions. [2019-01-14 01:29:35,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:29:35,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-01-14 01:29:35,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:35,744 INFO L225 Difference]: With dead ends: 32955 [2019-01-14 01:29:35,744 INFO L226 Difference]: Without dead ends: 32954 [2019-01-14 01:29:35,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:29:35,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32954 states. [2019-01-14 01:29:36,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32954 to 23705. [2019-01-14 01:29:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23705 states. [2019-01-14 01:29:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23705 states to 23705 states and 33462 transitions. [2019-01-14 01:29:36,333 INFO L78 Accepts]: Start accepts. Automaton has 23705 states and 33462 transitions. Word has length 57 [2019-01-14 01:29:36,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:36,333 INFO L480 AbstractCegarLoop]: Abstraction has 23705 states and 33462 transitions. [2019-01-14 01:29:36,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:29:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 23705 states and 33462 transitions. [2019-01-14 01:29:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-14 01:29:36,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:36,337 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1] [2019-01-14 01:29:36,337 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:36,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:36,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2087316113, now seen corresponding path program 4 times [2019-01-14 01:29:36,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:36,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:36,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:36,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:29:36,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:36,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:36,749 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-14 01:29:37,023 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:29:37,045 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:29:37,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:37,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:37,055 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:37,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:37,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 01:29:37,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:29:37,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:29:37,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:29:37,078 INFO L87 Difference]: Start difference. First operand 23705 states and 33462 transitions. Second operand 8 states. [2019-01-14 01:29:37,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:37,693 INFO L93 Difference]: Finished difference Result 33669 states and 48018 transitions. [2019-01-14 01:29:37,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 01:29:37,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2019-01-14 01:29:37,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:37,728 INFO L225 Difference]: With dead ends: 33669 [2019-01-14 01:29:37,728 INFO L226 Difference]: Without dead ends: 33668 [2019-01-14 01:29:37,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:29:37,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33668 states. [2019-01-14 01:29:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33668 to 25269. [2019-01-14 01:29:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25269 states. [2019-01-14 01:29:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25269 states to 25269 states and 35684 transitions. [2019-01-14 01:29:38,348 INFO L78 Accepts]: Start accepts. Automaton has 25269 states and 35684 transitions. Word has length 61 [2019-01-14 01:29:38,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:38,348 INFO L480 AbstractCegarLoop]: Abstraction has 25269 states and 35684 transitions. [2019-01-14 01:29:38,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:29:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 25269 states and 35684 transitions. [2019-01-14 01:29:38,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-14 01:29:38,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:38,352 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 1, 1] [2019-01-14 01:29:38,352 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:38,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:38,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1714864998, now seen corresponding path program 8 times [2019-01-14 01:29:38,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:38,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:38,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:38,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:29:38,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:38,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:38,531 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-14 01:29:38,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:29:38,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:29:38,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:38,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:38,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:38,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 01:29:38,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 01:29:38,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 01:29:38,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:29:38,595 INFO L87 Difference]: Start difference. First operand 25269 states and 35684 transitions. Second operand 11 states. [2019-01-14 01:29:39,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:39,333 INFO L93 Difference]: Finished difference Result 34130 states and 48968 transitions. [2019-01-14 01:29:39,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 01:29:39,335 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-01-14 01:29:39,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:39,375 INFO L225 Difference]: With dead ends: 34130 [2019-01-14 01:29:39,375 INFO L226 Difference]: Without dead ends: 34128 [2019-01-14 01:29:39,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:29:39,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34128 states. [2019-01-14 01:29:40,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34128 to 29345. [2019-01-14 01:29:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29345 states. [2019-01-14 01:29:40,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29345 states to 29345 states and 41306 transitions. [2019-01-14 01:29:40,425 INFO L78 Accepts]: Start accepts. Automaton has 29345 states and 41306 transitions. Word has length 63 [2019-01-14 01:29:40,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:40,425 INFO L480 AbstractCegarLoop]: Abstraction has 29345 states and 41306 transitions. [2019-01-14 01:29:40,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 01:29:40,425 INFO L276 IsEmpty]: Start isEmpty. Operand 29345 states and 41306 transitions. [2019-01-14 01:29:40,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-14 01:29:40,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:40,429 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1] [2019-01-14 01:29:40,430 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:40,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:40,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1360130479, now seen corresponding path program 6 times [2019-01-14 01:29:40,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:40,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:40,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:40,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:29:40,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:40,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:40,657 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-14 01:29:40,667 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:29:40,699 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-14 01:29:40,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:40,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:40,708 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:40,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:40,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 01:29:40,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:29:40,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:29:40,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:29:40,728 INFO L87 Difference]: Start difference. First operand 29345 states and 41306 transitions. Second operand 9 states. [2019-01-14 01:29:41,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:41,486 INFO L93 Difference]: Finished difference Result 41880 states and 59971 transitions. [2019-01-14 01:29:41,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:29:41,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-01-14 01:29:41,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:41,530 INFO L225 Difference]: With dead ends: 41880 [2019-01-14 01:29:41,530 INFO L226 Difference]: Without dead ends: 41878 [2019-01-14 01:29:41,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:29:41,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41878 states. [2019-01-14 01:29:42,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41878 to 35465. [2019-01-14 01:29:42,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35465 states. [2019-01-14 01:29:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35465 states to 35465 states and 49718 transitions. [2019-01-14 01:29:42,854 INFO L78 Accepts]: Start accepts. Automaton has 35465 states and 49718 transitions. Word has length 63 [2019-01-14 01:29:42,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:42,854 INFO L480 AbstractCegarLoop]: Abstraction has 35465 states and 49718 transitions. [2019-01-14 01:29:42,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:29:42,854 INFO L276 IsEmpty]: Start isEmpty. Operand 35465 states and 49718 transitions. [2019-01-14 01:29:42,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-14 01:29:42,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:42,859 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 1, 1] [2019-01-14 01:29:42,859 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:42,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:42,859 INFO L82 PathProgramCache]: Analyzing trace with hash -851477649, now seen corresponding path program 6 times [2019-01-14 01:29:42,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:42,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:42,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:42,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:29:42,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:42,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:42,988 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-14 01:29:42,999 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:29:43,019 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-01-14 01:29:43,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:43,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:43,031 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:43,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:43,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 01:29:43,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 01:29:43,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 01:29:43,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:29:43,050 INFO L87 Difference]: Start difference. First operand 35465 states and 49718 transitions. Second operand 10 states. [2019-01-14 01:29:44,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:44,124 INFO L93 Difference]: Finished difference Result 51129 states and 72397 transitions. [2019-01-14 01:29:44,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 01:29:44,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-01-14 01:29:44,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:44,179 INFO L225 Difference]: With dead ends: 51129 [2019-01-14 01:29:44,179 INFO L226 Difference]: Without dead ends: 51128 [2019-01-14 01:29:44,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:29:44,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51128 states. [2019-01-14 01:29:45,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51128 to 37261. [2019-01-14 01:29:45,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37261 states. [2019-01-14 01:29:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37261 states to 37261 states and 52271 transitions. [2019-01-14 01:29:45,161 INFO L78 Accepts]: Start accepts. Automaton has 37261 states and 52271 transitions. Word has length 65 [2019-01-14 01:29:45,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:45,162 INFO L480 AbstractCegarLoop]: Abstraction has 37261 states and 52271 transitions. [2019-01-14 01:29:45,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 01:29:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 37261 states and 52271 transitions. [2019-01-14 01:29:45,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-14 01:29:45,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:45,167 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 1, 1] [2019-01-14 01:29:45,167 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:45,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:45,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1457084265, now seen corresponding path program 9 times [2019-01-14 01:29:45,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:45,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:45,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:45,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:29:45,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:45,323 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:45,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:45,324 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-14 01:29:45,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:29:45,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-14 01:29:45,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:45,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:45,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:45,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 01:29:45,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 01:29:45,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 01:29:45,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:29:45,409 INFO L87 Difference]: Start difference. First operand 37261 states and 52271 transitions. Second operand 12 states. [2019-01-14 01:29:46,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:46,428 INFO L93 Difference]: Finished difference Result 49299 states and 70254 transitions. [2019-01-14 01:29:46,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 01:29:46,429 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-01-14 01:29:46,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:46,488 INFO L225 Difference]: With dead ends: 49299 [2019-01-14 01:29:46,489 INFO L226 Difference]: Without dead ends: 49297 [2019-01-14 01:29:46,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 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-14 01:29:46,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49297 states. [2019-01-14 01:29:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49297 to 42813. [2019-01-14 01:29:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42813 states. [2019-01-14 01:29:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42813 states to 42813 states and 59889 transitions. [2019-01-14 01:29:47,872 INFO L78 Accepts]: Start accepts. Automaton has 42813 states and 59889 transitions. Word has length 70 [2019-01-14 01:29:47,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:47,872 INFO L480 AbstractCegarLoop]: Abstraction has 42813 states and 59889 transitions. [2019-01-14 01:29:47,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 01:29:47,872 INFO L276 IsEmpty]: Start isEmpty. Operand 42813 states and 59889 transitions. [2019-01-14 01:29:47,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-14 01:29:47,877 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:47,877 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1] [2019-01-14 01:29:47,878 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:47,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:47,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1593226108, now seen corresponding path program 5 times [2019-01-14 01:29:47,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:47,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:47,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:47,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:29:47,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:48,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:48,188 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-14 01:29:48,200 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:29:48,224 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-01-14 01:29:48,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:48,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:48,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:48,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 01:29:48,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:29:48,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:29:48,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:29:48,256 INFO L87 Difference]: Start difference. First operand 42813 states and 59889 transitions. Second operand 9 states. [2019-01-14 01:29:49,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:49,274 INFO L93 Difference]: Finished difference Result 59102 states and 83563 transitions. [2019-01-14 01:29:49,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:29:49,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-01-14 01:29:49,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:49,365 INFO L225 Difference]: With dead ends: 59102 [2019-01-14 01:29:49,365 INFO L226 Difference]: Without dead ends: 59101 [2019-01-14 01:29:49,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:29:49,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59101 states. [2019-01-14 01:29:50,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59101 to 45005. [2019-01-14 01:29:50,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45005 states. [2019-01-14 01:29:50,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45005 states to 45005 states and 62987 transitions. [2019-01-14 01:29:50,800 INFO L78 Accepts]: Start accepts. Automaton has 45005 states and 62987 transitions. Word has length 71 [2019-01-14 01:29:50,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:50,800 INFO L480 AbstractCegarLoop]: Abstraction has 45005 states and 62987 transitions. [2019-01-14 01:29:50,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:29:50,800 INFO L276 IsEmpty]: Start isEmpty. Operand 45005 states and 62987 transitions. [2019-01-14 01:29:50,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-14 01:29:50,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:50,806 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1] [2019-01-14 01:29:50,806 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:50,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:50,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1572566089, now seen corresponding path program 7 times [2019-01-14 01:29:50,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:50,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:50,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:50,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:29:50,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:51,067 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:51,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:51,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 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-14 01:29:51,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:51,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:51,102 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:51,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:51,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 01:29:51,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 01:29:51,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 01:29:51,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:29:51,121 INFO L87 Difference]: Start difference. First operand 45005 states and 62987 transitions. Second operand 10 states. [2019-01-14 01:29:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:52,266 INFO L93 Difference]: Finished difference Result 62465 states and 88920 transitions. [2019-01-14 01:29:52,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 01:29:52,266 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-01-14 01:29:52,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:52,335 INFO L225 Difference]: With dead ends: 62465 [2019-01-14 01:29:52,336 INFO L226 Difference]: Without dead ends: 62463 [2019-01-14 01:29:52,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:29:52,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62463 states. [2019-01-14 01:29:53,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62463 to 53489. [2019-01-14 01:29:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53489 states. [2019-01-14 01:29:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53489 states to 53489 states and 74598 transitions. [2019-01-14 01:29:53,698 INFO L78 Accepts]: Start accepts. Automaton has 53489 states and 74598 transitions. Word has length 72 [2019-01-14 01:29:53,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:53,698 INFO L480 AbstractCegarLoop]: Abstraction has 53489 states and 74598 transitions. [2019-01-14 01:29:53,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 01:29:53,698 INFO L276 IsEmpty]: Start isEmpty. Operand 53489 states and 74598 transitions. [2019-01-14 01:29:53,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-14 01:29:53,703 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:53,704 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 1, 1] [2019-01-14 01:29:53,704 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:53,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:53,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2147171801, now seen corresponding path program 7 times [2019-01-14 01:29:53,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:53,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:53,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:53,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:53,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:53,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:53,838 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-14 01:29:53,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:53,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:53,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:29:53,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 01:29:53,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 01:29:53,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 01:29:53,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:29:53,911 INFO L87 Difference]: Start difference. First operand 53489 states and 74598 transitions. Second operand 11 states. [2019-01-14 01:29:55,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:29:55,899 INFO L93 Difference]: Finished difference Result 75498 states and 106380 transitions. [2019-01-14 01:29:55,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 01:29:55,900 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-01-14 01:29:55,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:29:55,975 INFO L225 Difference]: With dead ends: 75498 [2019-01-14 01:29:55,975 INFO L226 Difference]: Without dead ends: 75497 [2019-01-14 01:29:55,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:29:56,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75497 states. [2019-01-14 01:29:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75497 to 55733. [2019-01-14 01:29:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55733 states. [2019-01-14 01:29:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55733 states to 55733 states and 77778 transitions. [2019-01-14 01:29:57,455 INFO L78 Accepts]: Start accepts. Automaton has 55733 states and 77778 transitions. Word has length 73 [2019-01-14 01:29:57,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:29:57,455 INFO L480 AbstractCegarLoop]: Abstraction has 55733 states and 77778 transitions. [2019-01-14 01:29:57,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 01:29:57,455 INFO L276 IsEmpty]: Start isEmpty. Operand 55733 states and 77778 transitions. [2019-01-14 01:29:57,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-14 01:29:57,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:29:57,462 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 1, 1] [2019-01-14 01:29:57,463 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:29:57,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:29:57,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1519696454, now seen corresponding path program 10 times [2019-01-14 01:29:57,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:29:57,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:29:57,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:57,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:29:57,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:29:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:29:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:57,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:29:57,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 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-14 01:29:57,616 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:29:57,641 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:29:57,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:29:57,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:29:58,026 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:29:58,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:29:58,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 23 [2019-01-14 01:29:58,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 01:29:58,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 01:29:58,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-01-14 01:29:58,058 INFO L87 Difference]: Start difference. First operand 55733 states and 77778 transitions. Second operand 24 states. [2019-01-14 01:30:01,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:01,604 INFO L93 Difference]: Finished difference Result 74710 states and 103067 transitions. [2019-01-14 01:30:01,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-14 01:30:01,605 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 77 [2019-01-14 01:30:01,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:01,607 INFO L225 Difference]: With dead ends: 74710 [2019-01-14 01:30:01,607 INFO L226 Difference]: Without dead ends: 1364 [2019-01-14 01:30:01,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2391 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2234, Invalid=5776, Unknown=0, NotChecked=0, Total=8010 [2019-01-14 01:30:01,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-01-14 01:30:01,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 585. [2019-01-14 01:30:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-01-14 01:30:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 700 transitions. [2019-01-14 01:30:01,684 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 700 transitions. Word has length 77 [2019-01-14 01:30:01,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:01,684 INFO L480 AbstractCegarLoop]: Abstraction has 585 states and 700 transitions. [2019-01-14 01:30:01,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 01:30:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 700 transitions. [2019-01-14 01:30:01,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-14 01:30:01,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:01,685 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 1, 1] [2019-01-14 01:30:01,686 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:01,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:01,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1093517585, now seen corresponding path program 8 times [2019-01-14 01:30:01,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:01,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:01,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:01,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:01,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:01,820 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:01,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:01,820 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-14 01:30:01,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:30:01,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:30:01,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:01,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:01,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:01,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 01:30:01,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 01:30:01,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 01:30:01,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:30:01,901 INFO L87 Difference]: Start difference. First operand 585 states and 700 transitions. Second operand 11 states. [2019-01-14 01:30:02,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:02,008 INFO L93 Difference]: Finished difference Result 701 states and 822 transitions. [2019-01-14 01:30:02,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 01:30:02,009 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2019-01-14 01:30:02,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:02,010 INFO L225 Difference]: With dead ends: 701 [2019-01-14 01:30:02,010 INFO L226 Difference]: Without dead ends: 587 [2019-01-14 01:30:02,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:30:02,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-01-14 01:30:02,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 481. [2019-01-14 01:30:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-14 01:30:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 563 transitions. [2019-01-14 01:30:02,029 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 563 transitions. Word has length 81 [2019-01-14 01:30:02,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:02,030 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 563 transitions. [2019-01-14 01:30:02,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 01:30:02,030 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 563 transitions. [2019-01-14 01:30:02,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-14 01:30:02,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:02,031 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 1, 1] [2019-01-14 01:30:02,032 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:02,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:02,032 INFO L82 PathProgramCache]: Analyzing trace with hash -944170313, now seen corresponding path program 6 times [2019-01-14 01:30:02,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:02,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:02,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:02,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:02,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:02,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:02,141 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-14 01:30:02,152 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:30:02,186 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-01-14 01:30:02,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:02,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:02,198 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:02,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:02,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 01:30:02,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 01:30:02,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 01:30:02,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:30:02,217 INFO L87 Difference]: Start difference. First operand 481 states and 563 transitions. Second operand 10 states. [2019-01-14 01:30:02,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:02,314 INFO L93 Difference]: Finished difference Result 546 states and 639 transitions. [2019-01-14 01:30:02,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 01:30:02,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-01-14 01:30:02,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:02,317 INFO L225 Difference]: With dead ends: 546 [2019-01-14 01:30:02,317 INFO L226 Difference]: Without dead ends: 379 [2019-01-14 01:30:02,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:30:02,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-01-14 01:30:02,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2019-01-14 01:30:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-01-14 01:30:02,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 417 transitions. [2019-01-14 01:30:02,331 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 417 transitions. Word has length 81 [2019-01-14 01:30:02,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:02,332 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 417 transitions. [2019-01-14 01:30:02,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 01:30:02,332 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 417 transitions. [2019-01-14 01:30:02,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-14 01:30:02,333 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:02,333 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 1, 1] [2019-01-14 01:30:02,333 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:02,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:02,334 INFO L82 PathProgramCache]: Analyzing trace with hash -2010450365, now seen corresponding path program 8 times [2019-01-14 01:30:02,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:02,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:02,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:02,456 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:02,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:02,456 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-14 01:30:02,467 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:30:02,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:30:02,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:02,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:02,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:02,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 01:30:02,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 01:30:02,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 01:30:02,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:30:02,523 INFO L87 Difference]: Start difference. First operand 379 states and 417 transitions. Second operand 12 states. [2019-01-14 01:30:02,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:02,586 INFO L93 Difference]: Finished difference Result 464 states and 501 transitions. [2019-01-14 01:30:02,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 01:30:02,587 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2019-01-14 01:30:02,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:02,588 INFO L225 Difference]: With dead ends: 464 [2019-01-14 01:30:02,588 INFO L226 Difference]: Without dead ends: 397 [2019-01-14 01:30:02,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:30:02,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-14 01:30:02,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 306. [2019-01-14 01:30:02,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-01-14 01:30:02,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 344 transitions. [2019-01-14 01:30:02,600 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 344 transitions. Word has length 81 [2019-01-14 01:30:02,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:02,600 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 344 transitions. [2019-01-14 01:30:02,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 01:30:02,600 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 344 transitions. [2019-01-14 01:30:02,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-14 01:30:02,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:02,602 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1] [2019-01-14 01:30:02,602 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:02,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:02,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1856106743, now seen corresponding path program 9 times [2019-01-14 01:30:02,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:02,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:02,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:02,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:02,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:02,992 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:02,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:02,992 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-14 01:30:03,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:30:03,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-14 01:30:03,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:03,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:03,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:03,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 01:30:03,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 01:30:03,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 01:30:03,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:30:03,071 INFO L87 Difference]: Start difference. First operand 306 states and 344 transitions. Second operand 12 states. [2019-01-14 01:30:03,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:03,118 INFO L93 Difference]: Finished difference Result 319 states and 357 transitions. [2019-01-14 01:30:03,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 01:30:03,120 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-01-14 01:30:03,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:03,120 INFO L225 Difference]: With dead ends: 319 [2019-01-14 01:30:03,120 INFO L226 Difference]: Without dead ends: 242 [2019-01-14 01:30:03,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:30:03,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-01-14 01:30:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 222. [2019-01-14 01:30:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-14 01:30:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 260 transitions. [2019-01-14 01:30:03,130 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 260 transitions. Word has length 90 [2019-01-14 01:30:03,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:03,130 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 260 transitions. [2019-01-14 01:30:03,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 01:30:03,130 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 260 transitions. [2019-01-14 01:30:03,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-14 01:30:03,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:03,131 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 1, 1] [2019-01-14 01:30:03,132 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:03,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:03,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1359938858, now seen corresponding path program 7 times [2019-01-14 01:30:03,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:03,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:03,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:03,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:03,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:03,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:03,434 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-14 01:30:03,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:03,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:03,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:03,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 01:30:03,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 01:30:03,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 01:30:03,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:30:03,511 INFO L87 Difference]: Start difference. First operand 222 states and 260 transitions. Second operand 11 states. [2019-01-14 01:30:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:03,569 INFO L93 Difference]: Finished difference Result 243 states and 280 transitions. [2019-01-14 01:30:03,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 01:30:03,570 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2019-01-14 01:30:03,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:03,571 INFO L225 Difference]: With dead ends: 243 [2019-01-14 01:30:03,571 INFO L226 Difference]: Without dead ends: 102 [2019-01-14 01:30:03,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 90 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-14 01:30:03,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-14 01:30:03,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-14 01:30:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-14 01:30:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 101 transitions. [2019-01-14 01:30:03,576 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 101 transitions. Word has length 91 [2019-01-14 01:30:03,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:03,576 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 101 transitions. [2019-01-14 01:30:03,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 01:30:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 101 transitions. [2019-01-14 01:30:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-14 01:30:03,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:03,577 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 1, 1] [2019-01-14 01:30:03,578 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:03,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:03,578 INFO L82 PathProgramCache]: Analyzing trace with hash -498811939, now seen corresponding path program 8 times [2019-01-14 01:30:03,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:03,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:03,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:03,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:03,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:03,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:03,909 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-14 01:30:03,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:30:03,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:30:03,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:03,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:03,984 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:04,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:04,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 01:30:04,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 01:30:04,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 01:30:04,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:30:04,004 INFO L87 Difference]: Start difference. First operand 102 states and 101 transitions. Second operand 12 states. [2019-01-14 01:30:04,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:04,039 INFO L93 Difference]: Finished difference Result 102 states and 101 transitions. [2019-01-14 01:30:04,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 01:30:04,040 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2019-01-14 01:30:04,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:04,041 INFO L225 Difference]: With dead ends: 102 [2019-01-14 01:30:04,041 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 01:30:04,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:30:04,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 01:30:04,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 01:30:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 01:30:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 01:30:04,043 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2019-01-14 01:30:04,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:04,044 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 01:30:04,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 01:30:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 01:30:04,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 01:30:04,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 01:30:04,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:04,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:04,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:04,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:04,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:04,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:04,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:04,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:04,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:04,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:04,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:04,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:04,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:04,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:04,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:05,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:05,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:05,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:05,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:05,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:05,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:05,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:05,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:05,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:05,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:05,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:05,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:05,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:05,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:05,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:05,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:05,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:05,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:05,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:06,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:06,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:06,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:06,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:06,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:06,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:06,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:06,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:06,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:06,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:06,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:06,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:06,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:06,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:06,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:06,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:06,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:06,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:06,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:07,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:07,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:07,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:07,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:07,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:07,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:07,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:07,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:07,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:07,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:07,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:07,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:07,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:08,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:08,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:08,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:08,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:08,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:08,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:08,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:08,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:08,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:08,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:08,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:08,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:08,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:08,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:08,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:09,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:09,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:09,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:09,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:10,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:10,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:10,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:10,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:10,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:10,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:11,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:11,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:11,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:11,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:11,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:11,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:11,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:12,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:12,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:12,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:12,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:12,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:12,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:12,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:12,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:12,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:13,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:13,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:14,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:14,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:14,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:14,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:14,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:15,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:15,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:15,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:15,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:16,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:16,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:17,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:17,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:17,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:17,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:18,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:19,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:19,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:20,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:21,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:21,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:21,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:21,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:22,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:22,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:22,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:22,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:22,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:23,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:23,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:23,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:24,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:24,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:24,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:24,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:24,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:25,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:25,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:25,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:25,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:25,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:27,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:27,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:27,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:29,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:30,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:32,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:33,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:35,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:35,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:35,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:36,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:36,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:36,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:40,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:44,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:48,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:48,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:51,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:54,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:30:54,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:01,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:01,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:04,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:07,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:07,633 WARN L181 SmtUtils]: Spent 1.06 m on a formula simplification. DAG size of input: 4654 DAG size of output: 3109 [2019-01-14 01:33:21,751 WARN L181 SmtUtils]: Spent 2.23 m on a formula simplification. DAG size of input: 2580 DAG size of output: 409 [2019-01-14 01:33:21,759 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 31) no Hoare annotation was computed. [2019-01-14 01:33:21,759 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 31) no Hoare annotation was computed. [2019-01-14 01:33:21,759 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 33) no Hoare annotation was computed. [2019-01-14 01:33:21,759 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-01-14 01:33:21,759 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2019-01-14 01:33:21,759 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 01:33:21,759 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 01:33:21,759 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-14 01:33:21,759 INFO L448 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2019-01-14 01:33:21,760 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-01-14 01:33:21,760 INFO L448 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2019-01-14 01:33:21,760 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-14 01:33:21,760 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-01-14 01:33:21,760 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-01-14 01:33:21,760 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2019-01-14 01:33:21,760 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 01:33:21,760 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-01-14 01:33:21,760 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 31) no Hoare annotation was computed. [2019-01-14 01:33:21,760 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-01-14 01:33:21,761 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:33:21,761 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-01-14 01:33:21,761 INFO L451 ceAbstractionStarter]: At program point L34(lines 13 35) the Hoare annotation is: true [2019-01-14 01:33:21,761 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:33:21,761 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-01-14 01:33:21,761 INFO L448 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2019-01-14 01:33:21,762 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2019-01-14 01:33:21,766 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-01-14 01:33:21,766 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 32) no Hoare annotation was computed. [2019-01-14 01:33:21,773 INFO L444 ceAbstractionStarter]: At program point L22-1(lines 19 33) the Hoare annotation is: (let ((.cse33 (<= ULTIMATE.start_main_~y~0 0)) (.cse84 (<= 0 (+ ULTIMATE.start_main_~x~0 2147483648))) (.cse34 (<= ULTIMATE.start_main_~N~0 10)) (.cse89 (<= 0 (+ ULTIMATE.start_main_~y~0 2147483648))) (.cse40 (<= ULTIMATE.start_main_~x~0 0)) (.cse68 (<= 0 ULTIMATE.start_main_~i~0))) (let ((.cse42 (<= ULTIMATE.start_main_~y~0 1)) (.cse51 (and .cse84 .cse34 .cse89 .cse40 .cse68)) (.cse11 (<= ULTIMATE.start_main_~x~0 3)) (.cse12 (and .cse34 .cse89 .cse68)) (.cse80 (and .cse33 .cse34 .cse89 .cse68)) (.cse65 (and .cse34 .cse40 .cse68)) (.cse35 (<= ULTIMATE.start_main_~x~0 1)) (.cse39 (<= 0 (+ ULTIMATE.start_main_~x~0 1))) (.cse8 (<= 0 ULTIMATE.start_main_~y~0)) (.cse38 (<= 0 (+ ULTIMATE.start_main_~x~0 2)))) (let ((.cse56 (and .cse33 .cse34 .cse38 .cse40 .cse89 .cse68)) (.cse60 (<= ULTIMATE.start_main_~x~0 2)) (.cse41 (<= ULTIMATE.start_main_~y~0 3)) (.cse81 (and .cse40 (and .cse84 .cse34 .cse68))) (.cse10 (<= ULTIMATE.start_main_~y~0 5)) (.cse87 (and .cse39 .cse34 .cse40 .cse8 .cse68)) (.cse4 (<= 9 ULTIMATE.start_main_~i~0)) (.cse86 (and .cse34 .cse35 .cse8 .cse68)) (.cse23 (<= 0 (+ ULTIMATE.start_main_~x~0 3))) (.cse37 (and .cse39 .cse33 .cse89 .cse65)) (.cse9 (<= 8 ULTIMATE.start_main_~i~0)) (.cse3 (<= 0 ULTIMATE.start_main_~x~0)) (.cse59 (<= 0 (+ ULTIMATE.start_main_~x~0 4))) (.cse7 (<= ULTIMATE.start_main_~x~0 5)) (.cse15 (<= 0 (+ ULTIMATE.start_main_~y~0 3))) (.cse67 (or (and .cse11 .cse12) .cse80)) (.cse20 (<= ULTIMATE.start_main_~y~0 2)) (.cse5 (and .cse34 .cse68)) (.cse0 (<= ULTIMATE.start_main_~x~0 4)) (.cse13 (and .cse33 .cse51)) (.cse28 (<= 0 (+ ULTIMATE.start_main_~y~0 2))) (.cse79 (and .cse42 .cse34 .cse68))) (let ((.cse22 (and .cse51 .cse8)) (.cse48 (and .cse38 .cse51 .cse8)) (.cse21 (and .cse8 .cse79)) (.cse25 (and .cse13 .cse28)) (.cse29 (<= ULTIMATE.start_main_~x~0 8)) (.cse58 (and .cse5 .cse0)) (.cse46 (<= ULTIMATE.start_main_~x~0 6)) (.cse1 (and .cse33 .cse34 .cse28 .cse68)) (.cse52 (and .cse0 .cse80)) (.cse69 (<= 1 ULTIMATE.start_main_~i~0)) (.cse18 (and .cse20 .cse84 .cse34 .cse40 .cse68)) (.cse74 (and .cse11 .cse67)) (.cse78 (and .cse84 .cse33 .cse34 .cse40 .cse15 .cse68)) (.cse49 (and .cse7 .cse12)) (.cse44 (and .cse59 .cse33 .cse51)) (.cse73 (or (and .cse37 .cse9) (and .cse33 .cse34 .cse35 .cse9 .cse89 .cse3))) (.cse54 (and .cse84 .cse33 .cse34 .cse40 .cse68)) (.cse64 (and .cse20 .cse12)) (.cse50 (<= 0 (+ ULTIMATE.start_main_~y~0 5))) (.cse75 (and .cse23 .cse13)) (.cse61 (<= 3 ULTIMATE.start_main_~i~0)) (.cse63 (<= 0 (+ ULTIMATE.start_main_~x~0 6))) (.cse82 (and .cse15 .cse80)) (.cse26 (<= 0 (+ ULTIMATE.start_main_~x~0 8))) (.cse55 (<= ULTIMATE.start_main_~y~0 7)) (.cse83 (and .cse39 .cse34 .cse40 .cse68)) (.cse70 (<= ULTIMATE.start_main_~y~0 8)) (.cse62 (or (and .cse4 .cse87) (and .cse4 .cse86 .cse3))) (.cse17 (and .cse33 .cse34 .cse3 .cse8 .cse68)) (.cse57 (<= 0 (+ ULTIMATE.start_main_~y~0 7))) (.cse47 (<= ULTIMATE.start_main_~x~0 7)) (.cse53 (and .cse10 .cse51)) (.cse76 (and .cse41 .cse81)) (.cse24 (<= ULTIMATE.start_main_~y~0 6)) (.cse16 (<= 10 ULTIMATE.start_main_~i~0)) (.cse66 (<= ULTIMATE.start_main_~x~0 9)) (.cse30 (and .cse33 .cse34 .cse68)) (.cse77 (and .cse84 .cse34 .cse40 .cse68)) (.cse43 (<= 2 ULTIMATE.start_main_~i~0)) (.cse88 (or (and .cse4 .cse56) (and .cse4 .cse33 .cse34 .cse89 .cse60 .cse3))) (.cse85 (and (and .cse11 .cse34 .cse68) .cse3)) (.cse32 (<= 0 (+ ULTIMATE.start_main_~y~0 4))) (.cse14 (<= 0 (+ ULTIMATE.start_main_~x~0 5))) (.cse45 (<= 0 (+ ULTIMATE.start_main_~y~0 6))) (.cse6 (<= ULTIMATE.start_main_~y~0 4)) (.cse36 (<= 5 ULTIMATE.start_main_~i~0)) (.cse2 (<= 6 ULTIMATE.start_main_~i~0)) (.cse27 (<= 7 ULTIMATE.start_main_~i~0)) (.cse19 (<= 0 (+ ULTIMATE.start_main_~x~0 7))) (.cse31 (<= 0 (+ ULTIMATE.start_main_~y~0 1))) (.cse71 (and .cse42 .cse84 .cse34 .cse40 .cse8 .cse68)) (.cse72 (<= 4 ULTIMATE.start_main_~i~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse3 .cse8) (and .cse9 (and .cse10 .cse11 .cse3 .cse12) .cse8) (and .cse13 .cse14 .cse9 .cse15) (and .cse16 (<= ULTIMATE.start_main_~x~0 10) .cse17) (and .cse4 .cse18 .cse19 .cse8) (and .cse20 .cse0 .cse12 .cse2 .cse3 .cse8) (and .cse7 .cse2 .cse3 .cse21) (and .cse4 .cse22 .cse23 .cse24) (and .cse16 .cse25 .cse26) (and .cse14 .cse13 .cse27 .cse28) (and .cse4 .cse29 .cse30 .cse31 .cse3) (and .cse32 .cse33 (or (and .cse34 .cse35 .cse36 .cse3) (and .cse37 .cse36))) (and .cse22 .cse38 .cse9 .cse24) (and .cse36 (and .cse39 .cse6 .cse34 .cse40) .cse8) (and .cse12 .cse41 .cse9 .cse7 .cse3 .cse8) (and .cse42 .cse34 .cse35 .cse43 .cse3 .cse8) (and .cse16 .cse44 .cse45) (and .cse16 (and .cse6 .cse12) .cse3 .cse8 .cse46) (and .cse4 .cse12 .cse41 .cse3 .cse8 .cse46) (and (and .cse47 .cse17) .cse27) (and .cse16 .cse48) (and .cse16 (and .cse33 .cse49 .cse3) .cse50) (and (and .cse6 .cse51) .cse27 .cse23 .cse8) (and (and .cse11 .cse41 .cse3 .cse8 .cse12) .cse2) (and .cse32 .cse9 .cse52 .cse3) (and .cse9 .cse23 .cse53 .cse8) (and .cse9 .cse26 .cse8 .cse54) (and .cse4 .cse48 .cse55) (and .cse56 .cse32 .cse2) (and .cse14 .cse36 .cse8 .cse54) (and .cse33 .cse34 .cse27 .cse57 .cse40 .cse3) (and .cse16 .cse58 .cse8 .cse3 .cse24) (and .cse27 .cse15 .cse52 .cse3) (and (and .cse33 .cse34 .cse3 .cse8 .cse46) .cse2) (and .cse59 .cse18 .cse2 .cse8) (and (and .cse41 .cse34 .cse60) .cse36 .cse3 .cse8) (and .cse4 .cse5 .cse60 .cse8 .cse3 .cse55) (and .cse1 .cse27 .cse7 .cse3) (and .cse0 .cse30 .cse36 .cse31 .cse3) (and .cse43 .cse38 .cse8 .cse54) (or (and .cse33 .cse61 .cse34 .cse35 .cse28 .cse3) (and .cse61 .cse37 .cse28)) (and (<= ULTIMATE.start_main_~y~0 9) .cse62 .cse3) (and .cse16 .cse33 .cse14 .cse51 .cse50) (and .cse33 .cse34 .cse27 .cse40 .cse63 .cse31) (and .cse64 .cse9 .cse3 .cse8 .cse46) (and .cse15 (or (and .cse33 .cse34 .cse60 .cse36 .cse3) (and .cse56 .cse36))) (and (or (and .cse39 .cse33 .cse43 .cse65) (and .cse33 .cse34 .cse35 .cse43 .cse3)) .cse31) (and .cse16 .cse66 .cse3 .cse21) (and .cse11 .cse33 .cse15 .cse67 .cse2 .cse3) (and .cse33 .cse34 .cse40 .cse3 .cse8 .cse68) (and .cse69 .cse33 .cse34 .cse40 .cse31 .cse3) (and .cse20 .cse61 .cse34 .cse35 .cse3 .cse8) (and .cse4 .cse44 .cse50) (and .cse65 .cse9 .cse70 .cse8 .cse3) (and .cse33 .cse34 .cse43 .cse28 .cse40 .cse3) (and .cse33 .cse45 .cse34 .cse9 .cse60 .cse3) (and .cse47 .cse9 .cse30 .cse31 .cse3) (and .cse27 .cse63 .cse71) (and .cse4 .cse25 .cse19) (and .cse33 .cse34 .cse40 .cse36 .cse50 .cse3) (and .cse16 .cse45 .cse52 .cse3) (and .cse10 .cse5 .cse35 .cse2 .cse3 .cse8) (and .cse14 .cse27 .cse18 .cse8) (and .cse9 .cse19 .cse71) (and (and .cse11 .cse42 .cse34) .cse72 .cse3 .cse8) (and .cse73 (<= 0 (+ ULTIMATE.start_main_~y~0 8)) .cse3) (and .cse65 .cse61 .cse41 .cse3 .cse8) (and .cse9 (and .cse42 .cse34 .cse47) .cse3 .cse8) (and .cse4 .cse45 (and .cse33 .cse74) .cse3) (and .cse32 .cse27 .cse75) (and .cse65 .cse27 .cse8 .cse3 .cse55) (and .cse11 .cse30 .cse72 .cse31 .cse3) (and .cse16 (and .cse29 .cse20 .cse34 .cse3 .cse8)) (and .cse4 (and .cse42 .cse29 .cse34 .cse3 .cse8)) (and .cse27 .cse19 .cse8 .cse54) (and .cse4 .cse76 .cse63 .cse8) (and .cse4 .cse66 .cse17) (and (and .cse41 .cse38 .cse51) .cse36 .cse8) (and .cse18 .cse23 .cse36 .cse8) (and .cse41 .cse23 .cse77 .cse2 .cse8) (and (and .cse6 .cse38 .cse51) .cse2 .cse8) (and .cse28 .cse23 .cse36 .cse13) (and .cse9 (and .cse29 .cse33 .cse34 .cse3 .cse8)) (and .cse9 .cse25 .cse63) (and .cse27 .cse30 .cse31 .cse3 .cse46) (and (or (and .cse33 .cse34 .cse27 .cse60 .cse3) (and .cse56 .cse27)) .cse50) (and .cse17 .cse36 .cse7) (and .cse16 .cse78 .cse19) (and .cse14 .cse2 .cse71) (and .cse79 .cse27 .cse3 .cse8 .cse46) (and .cse33 .cse61 .cse34 .cse40 .cse15 .cse3) (and .cse33 .cse45 .cse34 .cse40 .cse2 .cse3) (and .cse16 .cse32 .cse80 .cse3 .cse46) (and .cse16 (and (and .cse29 .cse1) .cse3)) (and .cse16 (and .cse81 .cse6) .cse63 .cse8) (and .cse59 .cse13 .cse28 .cse2) (and .cse32 .cse33 .cse27 .cse74 .cse3) (and .cse4 .cse45 .cse75) (and .cse16 .cse71) (and (or (and .cse37 .cse2) (and .cse33 .cse34 .cse35 .cse2 .cse3)) .cse50) (and .cse4 .cse33 .cse34 .cse40 .cse26 .cse31) (and (and .cse11 .cse20 .cse34) .cse36 .cse3 .cse8) (and .cse4 (<= 0 (+ ULTIMATE.start_main_~x~0 9)) .cse8 .cse54) (and .cse4 .cse82 .cse3 .cse46) (and .cse32 .cse33 .cse34 .cse40 .cse72 .cse3) (and .cse6 .cse9 .cse58 .cse3 .cse8) (and (or (and .cse27 .cse35 .cse5 .cse8 .cse3) (and .cse27 .cse83 .cse8)) .cse24) (and .cse59 .cse72 .cse8 .cse54) (and .cse61 .cse23 .cse8 .cse54) (and .cse6 .cse5 .cse60 .cse2 .cse3 .cse8) (and .cse16 .cse84 .cse33 .cse34 .cse40 .cse31) (and .cse4 (and .cse10 .cse0 .cse12) .cse3 .cse8) (and .cse1 .cse9 .cse3 .cse46) (and .cse4 .cse1 .cse47 .cse3) (and .cse4 .cse52 .cse50 .cse3) (and .cse33 .cse34 .cse40 .cse23 .cse72 .cse31) (and .cse16 .cse18 .cse26 .cse8) (and .cse41 .cse83 .cse72 .cse8) (and (and .cse10 (and .cse14 .cse81)) .cse16 .cse8) (and .cse16 (and .cse11 .cse3 .cse12) .cse55) (and .cse11 .cse17 .cse61) (and .cse32 .cse33 .cse34 .cse60 .cse2 .cse3) (and (or (and .cse69 .cse42 .cse34 .cse40 .cse3) (and .cse69 .cse39 .cse33 .cse34 .cse40) (and .cse69 .cse33 .cse34 .cse35 .cse3)) .cse8) (and .cse0 .cse36 .cse3 .cse8 .cse79) (and .cse14 .cse9 .cse76 .cse8) (and .cse4 .cse85 .cse8 .cse24) (and .cse9 .cse18 .cse63 .cse8) (and .cse61 (and .cse20 .cse39 .cse34 .cse40) .cse8) (and .cse9 .cse8 (and .cse59 .cse6 .cse81)) (and .cse16 (and .cse51 .cse23) .cse55) (and .cse16 (and .cse10 .cse12) .cse7 .cse3 .cse8) (and (and .cse65 .cse6) .cse72 .cse3 .cse8) (and .cse65 .cse2 .cse8 .cse3 .cse24) (and .cse59 .cse33 .cse34 .cse40 .cse36 .cse31) (and .cse33 .cse74 .cse9 .cse50 .cse3) (and .cse27 .cse64 .cse7 .cse3 .cse8) (and .cse4 .cse81 .cse6 .cse14 .cse8) (and .cse16 .cse5 .cse60 .cse8 .cse3) (and .cse4 .cse78 .cse63) (and .cse4 .cse32 .cse33 .cse49 .cse3) (and .cse44 .cse32 .cse9) (and .cse20 .cse34 .cse43 .cse40 .cse3 .cse8) (and .cse42 .cse61 .cse34 .cse60 .cse3 .cse8) (and .cse82 .cse9 .cse7 .cse3) (and (or (and .cse33 .cse61 .cse34 .cse60 .cse3) (and .cse33 .cse61 .cse34 .cse38 .cse40)) .cse31) (and .cse73 .cse57) (and .cse4 (and .cse10 .cse59 .cse51) .cse8) (and .cse63 .cse2 .cse8 .cse54) (and .cse4 .cse47 .cse64 .cse3 .cse8) (or (and .cse45 .cse37 .cse27) (and .cse33 .cse45 .cse34 .cse27 .cse35 .cse3)) (and .cse9 .cse50 .cse75) (and .cse71 .cse61 .cse38) (and .cse16 .cse32 .cse33 .cse51 .cse63) (and .cse82 .cse16 .cse47 .cse3) (and .cse59 .cse27 .cse15 .cse13) (and .cse4 .cse26 .cse71) (and (or (and .cse86 .cse9 .cse3) (and .cse9 .cse87)) .cse55) (and .cse30 .cse7 .cse2 .cse31 .cse3) (and (and .cse10 .cse83) .cse2 .cse8) (and .cse16 .cse19 (and .cse76 .cse8)) (and .cse5 .cse9 .cse60 .cse8 .cse3 .cse24) (and .cse41 .cse5 .cse35 .cse72 .cse3 .cse8) (and .cse70 .cse62) (and .cse17 .cse0 .cse72) (and .cse88 .cse57) (and .cse42 .cse39 .cse34 .cse43 .cse40 .cse8) (and (and .cse0 .cse41 .cse12) .cse27 .cse3 .cse8) (and .cse16 (and (and .cse12 .cse41) .cse47) .cse3 .cse8) (and .cse33 .cse14 .cse34 .cse40 .cse2 .cse31) (and .cse59 .cse36 .cse71) (and .cse53 .cse27 .cse38 .cse8) (and .cse59 .cse27 .cse76 .cse8) (and (or (and .cse33 .cse34 .cse60 .cse72 .cse3) (and .cse56 .cse72)) .cse28) (and .cse11 .cse28 .cse36 .cse80 .cse3) (and .cse16 (and .cse59 .cse51 .cse8) .cse24) (and .cse16 .cse66 .cse30 .cse31 .cse3) (and .cse10 .cse65 .cse36 .cse3 .cse8) (and .cse20 .cse38 .cse77 .cse72 .cse8) (and .cse33 .cse34 .cse43 .cse60 .cse3 .cse8) (and (or (and .cse34 .cse35 .cse72 .cse3) (and .cse37 .cse72)) .cse33 .cse15) (and (<= 0 (+ ULTIMATE.start_main_~y~0 9)) (and .cse39 .cse88)) (and .cse6 .cse85 .cse27 .cse8) (and (and .cse20 .cse34 .cse60) .cse72 .cse3 .cse8) (and .cse4 .cse32 .cse33 .cse14 .cse51) (and .cse56 .cse45 .cse9) (and .cse6 .cse35 .cse5 .cse36 .cse3 .cse8) (and .cse23 .cse13 .cse15 .cse2) (and .cse10 .cse27 .cse5 .cse60 .cse3 .cse8) (and .cse33 .cse34 .cse40 .cse9 .cse19 .cse31) (and .cse71 .cse23 .cse72)))))) [2019-01-14 01:33:21,773 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-01-14 01:33:21,773 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-01-14 01:33:21,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 01:33:21 BoogieIcfgContainer [2019-01-14 01:33:21,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 01:33:21,889 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 01:33:21,889 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 01:33:21,889 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 01:33:21,889 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:29:15" (3/4) ... [2019-01-14 01:33:21,896 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 01:33:21,910 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 01:33:21,912 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 01:33:22,005 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 01:33:22,008 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 01:33:22,009 INFO L168 Benchmark]: Toolchain (without parser) took 247431.30 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 950.0 MB in the beginning and 776.1 MB in the end (delta: 173.9 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-01-14 01:33:22,011 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:33:22,012 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.19 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 01:33:22,013 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.13 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:33:22,013 INFO L168 Benchmark]: Boogie Preprocessor took 38.59 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:33:22,013 INFO L168 Benchmark]: RCFGBuilder took 504.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 01:33:22,014 INFO L168 Benchmark]: TraceAbstraction took 246431.31 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 776.1 MB in the end (delta: 322.3 MB). Peak memory consumption was 4.7 GB. Max. memory is 11.5 GB. [2019-01-14 01:33:22,018 INFO L168 Benchmark]: Witness Printer took 119.10 ms. Allocated memory is still 5.0 GB. Free memory is still 776.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:33:22,026 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 290.19 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.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 42.13 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.59 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 504.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 246431.31 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 776.1 MB in the end (delta: 322.3 MB). Peak memory consumption was 4.7 GB. Max. memory is 11.5 GB. * Witness Printer took 119.10 ms. Allocated memory is still 5.0 GB. Free memory is still 776.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: 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: 28]: 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: 26]: 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: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((x <= 4 && ((y <= 0 && N <= 10) && 0 <= y + 2) && 0 <= i) && 6 <= i) && 0 <= x) || (((((9 <= i && N <= 10 && 0 <= i) && y <= 4) && x <= 5) && 0 <= x) && 0 <= y)) || ((8 <= i && ((y <= 5 && x <= 3) && 0 <= x) && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && 0 <= y)) || ((((y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= x + 5) && 8 <= i) && 0 <= y + 3)) || ((10 <= i && x <= 10) && (((y <= 0 && N <= 10) && 0 <= x) && 0 <= y) && 0 <= i)) || (((9 <= i && (((y <= 2 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= i) && 0 <= x + 7) && 0 <= y)) || (((((y <= 2 && x <= 4) && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && 6 <= i) && 0 <= x) && 0 <= y)) || (((x <= 5 && 6 <= i) && 0 <= x) && 0 <= y && (y <= 1 && N <= 10) && 0 <= i)) || (((9 <= i && ((((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y) && 0 <= x + 3) && y <= 6)) || ((10 <= i && (y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y + 2) && 0 <= x + 8)) || (((0 <= x + 5 && y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 7 <= i) && 0 <= y + 2)) || ((((9 <= i && x <= 8) && (y <= 0 && N <= 10) && 0 <= i) && 0 <= y + 1) && 0 <= x)) || ((0 <= y + 4 && y <= 0) && ((((N <= 10 && x <= 1) && 5 <= i) && 0 <= x) || ((((0 <= x + 1 && y <= 0) && 0 <= y + 2147483648) && (N <= 10 && x <= 0) && 0 <= i) && 5 <= i)))) || ((((((((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y) && 0 <= x + 2) && 8 <= i) && y <= 6)) || ((5 <= i && ((0 <= x + 1 && y <= 4) && N <= 10) && x <= 0) && 0 <= y)) || (((((((N <= 10 && 0 <= y + 2147483648) && 0 <= i) && y <= 3) && 8 <= i) && x <= 5) && 0 <= x) && 0 <= y)) || (((((y <= 1 && N <= 10) && x <= 1) && 2 <= i) && 0 <= x) && 0 <= y)) || ((10 <= i && (0 <= x + 4 && y <= 0) && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y + 6)) || ((((10 <= i && y <= 4 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && 0 <= x) && 0 <= y) && x <= 6)) || (((((9 <= i && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && y <= 3) && 0 <= x) && 0 <= y) && x <= 6)) || ((x <= 7 && (((y <= 0 && N <= 10) && 0 <= x) && 0 <= y) && 0 <= i) && 7 <= i)) || (10 <= i && (0 <= x + 2 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y)) || ((10 <= i && (y <= 0 && x <= 5 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && 0 <= x) && 0 <= y + 5)) || ((((y <= 4 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 7 <= i) && 0 <= x + 3) && 0 <= y)) || (((((x <= 3 && y <= 3) && 0 <= x) && 0 <= y) && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && 6 <= i)) || (((0 <= y + 4 && 8 <= i) && x <= 4 && ((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i) && 0 <= x)) || (((8 <= i && 0 <= x + 3) && y <= 5 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y)) || (((8 <= i && 0 <= x + 8) && 0 <= y) && (((0 <= x + 2147483648 && y <= 0) && N <= 10) && x <= 0) && 0 <= i)) || ((9 <= i && (0 <= x + 2 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y) && y <= 7)) || (((((((y <= 0 && N <= 10) && 0 <= x + 2) && x <= 0) && 0 <= y + 2147483648) && 0 <= i) && 0 <= y + 4) && 6 <= i)) || (((0 <= x + 5 && 5 <= i) && 0 <= y) && (((0 <= x + 2147483648 && y <= 0) && N <= 10) && x <= 0) && 0 <= i)) || (((((y <= 0 && N <= 10) && 7 <= i) && 0 <= y + 7) && x <= 0) && 0 <= x)) || ((((10 <= i && (N <= 10 && 0 <= i) && x <= 4) && 0 <= y) && 0 <= x) && y <= 6)) || (((7 <= i && 0 <= y + 3) && x <= 4 && ((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i) && 0 <= x)) || (((((y <= 0 && N <= 10) && 0 <= x) && 0 <= y) && x <= 6) && 6 <= i)) || (((0 <= x + 4 && (((y <= 2 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= i) && 6 <= i) && 0 <= y)) || (((((y <= 3 && N <= 10) && x <= 2) && 5 <= i) && 0 <= x) && 0 <= y)) || (((((9 <= i && N <= 10 && 0 <= i) && x <= 2) && 0 <= y) && 0 <= x) && y <= 7)) || ((((((y <= 0 && N <= 10) && 0 <= y + 2) && 0 <= i) && 7 <= i) && x <= 5) && 0 <= x)) || ((((x <= 4 && (y <= 0 && N <= 10) && 0 <= i) && 5 <= i) && 0 <= y + 1) && 0 <= x)) || (((2 <= i && 0 <= x + 2) && 0 <= y) && (((0 <= x + 2147483648 && y <= 0) && N <= 10) && x <= 0) && 0 <= i)) || (((((y <= 0 && 3 <= i) && N <= 10) && x <= 1) && 0 <= y + 2) && 0 <= x) || ((3 <= i && ((0 <= x + 1 && y <= 0) && 0 <= y + 2147483648) && (N <= 10 && x <= 0) && 0 <= i) && 0 <= y + 2)) || ((y <= 9 && ((9 <= i && (((0 <= x + 1 && N <= 10) && x <= 0) && 0 <= y) && 0 <= i) || ((9 <= i && ((N <= 10 && x <= 1) && 0 <= y) && 0 <= i) && 0 <= x))) && 0 <= x)) || ((((10 <= i && y <= 0) && 0 <= x + 5) && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y + 5)) || (((((y <= 0 && N <= 10) && 7 <= i) && x <= 0) && 0 <= x + 6) && 0 <= y + 1)) || (((((y <= 2 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && 8 <= i) && 0 <= x) && 0 <= y) && x <= 6)) || (0 <= y + 3 && (((((y <= 0 && N <= 10) && x <= 2) && 5 <= i) && 0 <= x) || ((((((y <= 0 && N <= 10) && 0 <= x + 2) && x <= 0) && 0 <= y + 2147483648) && 0 <= i) && 5 <= i)))) || (((((0 <= x + 1 && y <= 0) && 2 <= i) && (N <= 10 && x <= 0) && 0 <= i) || ((((y <= 0 && N <= 10) && x <= 1) && 2 <= i) && 0 <= x)) && 0 <= y + 1)) || (((10 <= i && x <= 9) && 0 <= x) && 0 <= y && (y <= 1 && N <= 10) && 0 <= i)) || (((((x <= 3 && y <= 0) && 0 <= y + 3) && ((x <= 3 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) || (((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i))) && 6 <= i) && 0 <= x)) || (((((y <= 0 && N <= 10) && x <= 0) && 0 <= x) && 0 <= y) && 0 <= i)) || (((((1 <= i && y <= 0) && N <= 10) && x <= 0) && 0 <= y + 1) && 0 <= x)) || (((((y <= 2 && 3 <= i) && N <= 10) && x <= 1) && 0 <= x) && 0 <= y)) || ((9 <= i && (0 <= x + 4 && y <= 0) && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y + 5)) || ((((((N <= 10 && x <= 0) && 0 <= i) && 8 <= i) && y <= 8) && 0 <= y) && 0 <= x)) || (((((y <= 0 && N <= 10) && 2 <= i) && 0 <= y + 2) && x <= 0) && 0 <= x)) || (((((y <= 0 && 0 <= y + 6) && N <= 10) && 8 <= i) && x <= 2) && 0 <= x)) || ((((x <= 7 && 8 <= i) && (y <= 0 && N <= 10) && 0 <= i) && 0 <= y + 1) && 0 <= x)) || ((7 <= i && 0 <= x + 6) && ((((y <= 1 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= y) && 0 <= i)) || ((9 <= i && (y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y + 2) && 0 <= x + 7)) || (((((y <= 0 && N <= 10) && x <= 0) && 5 <= i) && 0 <= y + 5) && 0 <= x)) || (((10 <= i && 0 <= y + 6) && x <= 4 && ((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i) && 0 <= x)) || (((((y <= 5 && N <= 10 && 0 <= i) && x <= 1) && 6 <= i) && 0 <= x) && 0 <= y)) || (((0 <= x + 5 && 7 <= i) && (((y <= 2 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= i) && 0 <= y)) || ((8 <= i && 0 <= x + 7) && ((((y <= 1 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= y) && 0 <= i)) || (((((x <= 3 && y <= 1) && N <= 10) && 4 <= i) && 0 <= x) && 0 <= y)) || (((((((0 <= x + 1 && y <= 0) && 0 <= y + 2147483648) && (N <= 10 && x <= 0) && 0 <= i) && 8 <= i) || (((((y <= 0 && N <= 10) && x <= 1) && 8 <= i) && 0 <= y + 2147483648) && 0 <= x)) && 0 <= y + 8) && 0 <= x)) || ((((((N <= 10 && x <= 0) && 0 <= i) && 3 <= i) && y <= 3) && 0 <= x) && 0 <= y)) || (((8 <= i && (y <= 1 && N <= 10) && x <= 7) && 0 <= x) && 0 <= y)) || (((9 <= i && 0 <= y + 6) && y <= 0 && x <= 3 && ((x <= 3 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) || (((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i))) && 0 <= x)) || ((0 <= y + 4 && 7 <= i) && 0 <= x + 3 && y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i)) || ((((((N <= 10 && x <= 0) && 0 <= i) && 7 <= i) && 0 <= y) && 0 <= x) && y <= 7)) || ((((x <= 3 && (y <= 0 && N <= 10) && 0 <= i) && 4 <= i) && 0 <= y + 1) && 0 <= x)) || (10 <= i && (((x <= 8 && y <= 2) && N <= 10) && 0 <= x) && 0 <= y)) || (9 <= i && (((y <= 1 && x <= 8) && N <= 10) && 0 <= x) && 0 <= y)) || (((7 <= i && 0 <= x + 7) && 0 <= y) && (((0 <= x + 2147483648 && y <= 0) && N <= 10) && x <= 0) && 0 <= i)) || (((9 <= i && y <= 3 && x <= 0 && (0 <= x + 2147483648 && N <= 10) && 0 <= i) && 0 <= x + 6) && 0 <= y)) || ((9 <= i && x <= 9) && (((y <= 0 && N <= 10) && 0 <= x) && 0 <= y) && 0 <= i)) || ((((y <= 3 && 0 <= x + 2) && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 5 <= i) && 0 <= y)) || (((((((y <= 2 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= i) && 0 <= x + 3) && 5 <= i) && 0 <= y)) || ((((y <= 3 && 0 <= x + 3) && ((0 <= x + 2147483648 && N <= 10) && x <= 0) && 0 <= i) && 6 <= i) && 0 <= y)) || ((((y <= 4 && 0 <= x + 2) && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 6 <= i) && 0 <= y)) || (((0 <= y + 2 && 0 <= x + 3) && 5 <= i) && y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i)) || (8 <= i && (((x <= 8 && y <= 0) && N <= 10) && 0 <= x) && 0 <= y)) || ((8 <= i && (y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y + 2) && 0 <= x + 6)) || ((((7 <= i && (y <= 0 && N <= 10) && 0 <= i) && 0 <= y + 1) && 0 <= x) && x <= 6)) || ((((((y <= 0 && N <= 10) && 7 <= i) && x <= 2) && 0 <= x) || ((((((y <= 0 && N <= 10) && 0 <= x + 2) && x <= 0) && 0 <= y + 2147483648) && 0 <= i) && 7 <= i)) && 0 <= y + 5)) || ((((((y <= 0 && N <= 10) && 0 <= x) && 0 <= y) && 0 <= i) && 5 <= i) && x <= 5)) || ((10 <= i && ((((0 <= x + 2147483648 && y <= 0) && N <= 10) && x <= 0) && 0 <= y + 3) && 0 <= i) && 0 <= x + 7)) || ((0 <= x + 5 && 6 <= i) && ((((y <= 1 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= y) && 0 <= i)) || ((((((y <= 1 && N <= 10) && 0 <= i) && 7 <= i) && 0 <= x) && 0 <= y) && x <= 6)) || (((((y <= 0 && 3 <= i) && N <= 10) && x <= 0) && 0 <= y + 3) && 0 <= x)) || (((((y <= 0 && 0 <= y + 6) && N <= 10) && x <= 0) && 6 <= i) && 0 <= x)) || ((((10 <= i && 0 <= y + 4) && ((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i) && 0 <= x) && x <= 6)) || (10 <= i && (x <= 8 && ((y <= 0 && N <= 10) && 0 <= y + 2) && 0 <= i) && 0 <= x)) || (((10 <= i && (x <= 0 && (0 <= x + 2147483648 && N <= 10) && 0 <= i) && y <= 4) && 0 <= x + 6) && 0 <= y)) || (((0 <= x + 4 && y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y + 2) && 6 <= i)) || ((((0 <= y + 4 && y <= 0) && 7 <= i) && x <= 3 && ((x <= 3 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) || (((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i))) && 0 <= x)) || ((9 <= i && 0 <= y + 6) && 0 <= x + 3 && y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i)) || (10 <= i && ((((y <= 1 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= y) && 0 <= i)) || ((((((0 <= x + 1 && y <= 0) && 0 <= y + 2147483648) && (N <= 10 && x <= 0) && 0 <= i) && 6 <= i) || ((((y <= 0 && N <= 10) && x <= 1) && 6 <= i) && 0 <= x)) && 0 <= y + 5)) || (((((9 <= i && y <= 0) && N <= 10) && x <= 0) && 0 <= x + 8) && 0 <= y + 1)) || (((((x <= 3 && y <= 2) && N <= 10) && 5 <= i) && 0 <= x) && 0 <= y)) || (((9 <= i && 0 <= x + 9) && 0 <= y) && (((0 <= x + 2147483648 && y <= 0) && N <= 10) && x <= 0) && 0 <= i)) || (((9 <= i && 0 <= y + 3 && ((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i) && 0 <= x) && x <= 6)) || (((((0 <= y + 4 && y <= 0) && N <= 10) && x <= 0) && 4 <= i) && 0 <= x)) || ((((y <= 4 && 8 <= i) && (N <= 10 && 0 <= i) && x <= 4) && 0 <= x) && 0 <= y)) || ((((((7 <= i && x <= 1) && N <= 10 && 0 <= i) && 0 <= y) && 0 <= x) || ((7 <= i && ((0 <= x + 1 && N <= 10) && x <= 0) && 0 <= i) && 0 <= y)) && y <= 6)) || (((0 <= x + 4 && 4 <= i) && 0 <= y) && (((0 <= x + 2147483648 && y <= 0) && N <= 10) && x <= 0) && 0 <= i)) || (((3 <= i && 0 <= x + 3) && 0 <= y) && (((0 <= x + 2147483648 && y <= 0) && N <= 10) && x <= 0) && 0 <= i)) || (((((y <= 4 && N <= 10 && 0 <= i) && x <= 2) && 6 <= i) && 0 <= x) && 0 <= y)) || (((((10 <= i && 0 <= x + 2147483648) && y <= 0) && N <= 10) && x <= 0) && 0 <= y + 1)) || (((9 <= i && (y <= 5 && x <= 4) && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && 0 <= x) && 0 <= y)) || ((((((y <= 0 && N <= 10) && 0 <= y + 2) && 0 <= i) && 8 <= i) && 0 <= x) && x <= 6)) || (((9 <= i && ((y <= 0 && N <= 10) && 0 <= y + 2) && 0 <= i) && x <= 7) && 0 <= x)) || (((9 <= i && x <= 4 && ((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i) && 0 <= y + 5) && 0 <= x)) || (((((y <= 0 && N <= 10) && x <= 0) && 0 <= x + 3) && 4 <= i) && 0 <= y + 1)) || (((10 <= i && (((y <= 2 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= i) && 0 <= x + 8) && 0 <= y)) || (((y <= 3 && ((0 <= x + 1 && N <= 10) && x <= 0) && 0 <= i) && 4 <= i) && 0 <= y)) || (((y <= 5 && 0 <= x + 5 && x <= 0 && (0 <= x + 2147483648 && N <= 10) && 0 <= i) && 10 <= i) && 0 <= y)) || ((10 <= i && (x <= 3 && 0 <= x) && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && y <= 7)) || ((x <= 3 && (((y <= 0 && N <= 10) && 0 <= x) && 0 <= y) && 0 <= i) && 3 <= i)) || (((((0 <= y + 4 && y <= 0) && N <= 10) && x <= 2) && 6 <= i) && 0 <= x)) || (((((((1 <= i && y <= 1) && N <= 10) && x <= 0) && 0 <= x) || ((((1 <= i && 0 <= x + 1) && y <= 0) && N <= 10) && x <= 0)) || ((((1 <= i && y <= 0) && N <= 10) && x <= 1) && 0 <= x)) && 0 <= y)) || ((((x <= 4 && 5 <= i) && 0 <= x) && 0 <= y) && (y <= 1 && N <= 10) && 0 <= i)) || (((0 <= x + 5 && 8 <= i) && y <= 3 && x <= 0 && (0 <= x + 2147483648 && N <= 10) && 0 <= i) && 0 <= y)) || (((9 <= i && ((x <= 3 && N <= 10) && 0 <= i) && 0 <= x) && 0 <= y) && y <= 6)) || (((8 <= i && (((y <= 2 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= i) && 0 <= x + 6) && 0 <= y)) || ((3 <= i && ((y <= 2 && 0 <= x + 1) && N <= 10) && x <= 0) && 0 <= y)) || ((8 <= i && 0 <= y) && (0 <= x + 4 && y <= 4) && x <= 0 && (0 <= x + 2147483648 && N <= 10) && 0 <= i)) || ((10 <= i && ((((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= x + 3) && y <= 7)) || ((((10 <= i && y <= 5 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && x <= 5) && 0 <= x) && 0 <= y)) || ((((((N <= 10 && x <= 0) && 0 <= i) && y <= 4) && 4 <= i) && 0 <= x) && 0 <= y)) || ((((((N <= 10 && x <= 0) && 0 <= i) && 6 <= i) && 0 <= y) && 0 <= x) && y <= 6)) || (((((0 <= x + 4 && y <= 0) && N <= 10) && x <= 0) && 5 <= i) && 0 <= y + 1)) || ((((y <= 0 && x <= 3 && ((x <= 3 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) || (((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i))) && 8 <= i) && 0 <= y + 5) && 0 <= x)) || ((((7 <= i && y <= 2 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && x <= 5) && 0 <= x) && 0 <= y)) || ((((9 <= i && x <= 0 && (0 <= x + 2147483648 && N <= 10) && 0 <= i) && y <= 4) && 0 <= x + 5) && 0 <= y)) || ((((10 <= i && N <= 10 && 0 <= i) && x <= 2) && 0 <= y) && 0 <= x)) || ((9 <= i && ((((0 <= x + 2147483648 && y <= 0) && N <= 10) && x <= 0) && 0 <= y + 3) && 0 <= i) && 0 <= x + 6)) || ((((9 <= i && 0 <= y + 4) && y <= 0) && x <= 5 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && 0 <= x)) || ((((0 <= x + 4 && y <= 0) && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y + 4) && 8 <= i)) || (((((y <= 2 && N <= 10) && 2 <= i) && x <= 0) && 0 <= x) && 0 <= y)) || (((((y <= 1 && 3 <= i) && N <= 10) && x <= 2) && 0 <= x) && 0 <= y)) || ((((0 <= y + 3 && ((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i) && 8 <= i) && x <= 5) && 0 <= x)) || ((((((y <= 0 && 3 <= i) && N <= 10) && x <= 2) && 0 <= x) || ((((y <= 0 && 3 <= i) && N <= 10) && 0 <= x + 2) && x <= 0)) && 0 <= y + 1)) || ((((((0 <= x + 1 && y <= 0) && 0 <= y + 2147483648) && (N <= 10 && x <= 0) && 0 <= i) && 8 <= i) || (((((y <= 0 && N <= 10) && x <= 1) && 8 <= i) && 0 <= y + 2147483648) && 0 <= x)) && 0 <= y + 7)) || ((9 <= i && (y <= 5 && 0 <= x + 4) && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y)) || (((0 <= x + 6 && 6 <= i) && 0 <= y) && (((0 <= x + 2147483648 && y <= 0) && N <= 10) && x <= 0) && 0 <= i)) || ((((9 <= i && x <= 7) && y <= 2 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && 0 <= x) && 0 <= y)) || ((0 <= y + 6 && ((0 <= x + 1 && y <= 0) && 0 <= y + 2147483648) && (N <= 10 && x <= 0) && 0 <= i) && 7 <= i) || (((((y <= 0 && 0 <= y + 6) && N <= 10) && 7 <= i) && x <= 1) && 0 <= x)) || ((8 <= i && 0 <= y + 5) && 0 <= x + 3 && y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i)) || (((((((y <= 1 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= y) && 0 <= i) && 3 <= i) && 0 <= x + 2)) || ((((10 <= i && 0 <= y + 4) && y <= 0) && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= x + 6)) || ((((0 <= y + 3 && ((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i) && 10 <= i) && x <= 7) && 0 <= x)) || (((0 <= x + 4 && 7 <= i) && 0 <= y + 3) && y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i)) || ((9 <= i && 0 <= x + 8) && ((((y <= 1 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= y) && 0 <= i)) || (((((((N <= 10 && x <= 1) && 0 <= y) && 0 <= i) && 8 <= i) && 0 <= x) || (8 <= i && (((0 <= x + 1 && N <= 10) && x <= 0) && 0 <= y) && 0 <= i)) && y <= 7)) || ((((((y <= 0 && N <= 10) && 0 <= i) && x <= 5) && 6 <= i) && 0 <= y + 1) && 0 <= x)) || (((y <= 5 && ((0 <= x + 1 && N <= 10) && x <= 0) && 0 <= i) && 6 <= i) && 0 <= y)) || ((10 <= i && 0 <= x + 7) && (y <= 3 && x <= 0 && (0 <= x + 2147483648 && N <= 10) && 0 <= i) && 0 <= y)) || ((((((N <= 10 && 0 <= i) && 8 <= i) && x <= 2) && 0 <= y) && 0 <= x) && y <= 6)) || (((((y <= 3 && N <= 10 && 0 <= i) && x <= 1) && 4 <= i) && 0 <= x) && 0 <= y)) || (y <= 8 && ((9 <= i && (((0 <= x + 1 && N <= 10) && x <= 0) && 0 <= y) && 0 <= i) || ((9 <= i && ((N <= 10 && x <= 1) && 0 <= y) && 0 <= i) && 0 <= x)))) || ((((((y <= 0 && N <= 10) && 0 <= x) && 0 <= y) && 0 <= i) && x <= 4) && 4 <= i)) || (((9 <= i && ((((y <= 0 && N <= 10) && 0 <= x + 2) && x <= 0) && 0 <= y + 2147483648) && 0 <= i) || (((((9 <= i && y <= 0) && N <= 10) && 0 <= y + 2147483648) && x <= 2) && 0 <= x)) && 0 <= y + 7)) || (((((y <= 1 && 0 <= x + 1) && N <= 10) && 2 <= i) && x <= 0) && 0 <= y)) || (((((x <= 4 && y <= 3) && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && 7 <= i) && 0 <= x) && 0 <= y)) || (((10 <= i && (((N <= 10 && 0 <= y + 2147483648) && 0 <= i) && y <= 3) && x <= 7) && 0 <= x) && 0 <= y)) || (((((y <= 0 && 0 <= x + 5) && N <= 10) && x <= 0) && 6 <= i) && 0 <= y + 1)) || ((0 <= x + 4 && 5 <= i) && ((((y <= 1 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= y) && 0 <= i)) || ((((y <= 5 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 7 <= i) && 0 <= x + 2) && 0 <= y)) || (((0 <= x + 4 && 7 <= i) && y <= 3 && x <= 0 && (0 <= x + 2147483648 && N <= 10) && 0 <= i) && 0 <= y)) || ((((((y <= 0 && N <= 10) && x <= 2) && 4 <= i) && 0 <= x) || ((((((y <= 0 && N <= 10) && 0 <= x + 2) && x <= 0) && 0 <= y + 2147483648) && 0 <= i) && 4 <= i)) && 0 <= y + 2)) || ((((x <= 3 && 0 <= y + 2) && 5 <= i) && ((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i) && 0 <= x)) || ((10 <= i && (0 <= x + 4 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y) && y <= 6)) || ((((10 <= i && x <= 9) && (y <= 0 && N <= 10) && 0 <= i) && 0 <= y + 1) && 0 <= x)) || ((((y <= 5 && (N <= 10 && x <= 0) && 0 <= i) && 5 <= i) && 0 <= x) && 0 <= y)) || ((((y <= 2 && 0 <= x + 2) && ((0 <= x + 2147483648 && N <= 10) && x <= 0) && 0 <= i) && 4 <= i) && 0 <= y)) || (((((y <= 0 && N <= 10) && 2 <= i) && x <= 2) && 0 <= x) && 0 <= y)) || ((((((N <= 10 && x <= 1) && 4 <= i) && 0 <= x) || ((((0 <= x + 1 && y <= 0) && 0 <= y + 2147483648) && (N <= 10 && x <= 0) && 0 <= i) && 4 <= i)) && y <= 0) && 0 <= y + 3)) || (0 <= y + 9 && 0 <= x + 1 && ((9 <= i && ((((y <= 0 && N <= 10) && 0 <= x + 2) && x <= 0) && 0 <= y + 2147483648) && 0 <= i) || (((((9 <= i && y <= 0) && N <= 10) && 0 <= y + 2147483648) && x <= 2) && 0 <= x)))) || (((y <= 4 && ((x <= 3 && N <= 10) && 0 <= i) && 0 <= x) && 7 <= i) && 0 <= y)) || (((((y <= 2 && N <= 10) && x <= 2) && 4 <= i) && 0 <= x) && 0 <= y)) || ((((9 <= i && 0 <= y + 4) && y <= 0) && 0 <= x + 5) && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i)) || (((((((y <= 0 && N <= 10) && 0 <= x + 2) && x <= 0) && 0 <= y + 2147483648) && 0 <= i) && 0 <= y + 6) && 8 <= i)) || (((((y <= 4 && x <= 1) && N <= 10 && 0 <= i) && 5 <= i) && 0 <= x) && 0 <= y)) || (((0 <= x + 3 && y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y + 3) && 6 <= i)) || (((((y <= 5 && 7 <= i) && N <= 10 && 0 <= i) && x <= 2) && 0 <= x) && 0 <= y)) || (((((y <= 0 && N <= 10) && x <= 0) && 8 <= i) && 0 <= x + 7) && 0 <= y + 1)) || (((((((y <= 1 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= y) && 0 <= i) && 0 <= x + 3) && 4 <= i) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 10 error locations. SAFE Result, 246.2s OverallTime, 44 OverallIterations, 11 TraceHistogramMax, 21.7s AutomataDifference, 0.0s DeadEndRemovalTime, 197.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1114 SDtfs, 6707 SDslu, 5061 SDs, 0 SdLazy, 1782 SolverSat, 967 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2202 GetRequests, 1883 SyntacticMatches, 0 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2394 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55733occurred in iteration=37, 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: 14.8s AutomataMinimizationTime, 44 MinimizatonAttempts, 130600 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 1768 NumberOfFragments, 5870 HoareAnnotationTreeSize, 2 FomulaSimplifications, 653905 FormulaSimplificationTreeSizeReduction, 63.5s HoareSimplificationTime, 2 FomulaSimplificationsInter, 133427 FormulaSimplificationTreeSizeReductionInter, 134.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 3913 NumberOfCodeBlocks, 3913 NumberOfCodeBlocksAsserted, 175 NumberOfCheckSat, 3831 ConstructedInterpolants, 0 QuantifiedInterpolants, 938773 SizeOfPredicates, 2 NumberOfNonLiveVariables, 4480 ConjunctsInSsa, 268 ConjunctsInUnsatCore, 82 InterpolantComputations, 9 PerfectInterpolantSequences, 388/11782 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...