java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem16_label50_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:53:56,473 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:53:56,475 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:53:56,488 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:53:56,488 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:53:56,489 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:53:56,493 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:53:56,496 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:53:56,497 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:53:56,499 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:53:56,500 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:53:56,501 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:53:56,502 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:53:56,505 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:53:56,506 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:53:56,507 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:53:56,509 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:53:56,510 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:53:56,512 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:53:56,514 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:53:56,515 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:53:56,516 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:53:56,519 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:53:56,519 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:53:56,519 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:53:56,520 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:53:56,521 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:53:56,522 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:53:56,523 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:53:56,524 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:53:56,524 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:53:56,525 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:53:56,525 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:53:56,526 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:53:56,527 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:53:56,528 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:53:56,528 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 01:53:56,546 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:53:56,546 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:53:56,547 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:53:56,548 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:53:56,548 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:53:56,548 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:53:56,548 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:53:56,548 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:53:56,549 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:53:56,549 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:53:56,549 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:53:56,549 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:53:56,549 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:53:56,549 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:53:56,551 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:53:56,552 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:53:56,552 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:53:56,552 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:53:56,552 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:53:56,552 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:53:56,553 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:53:56,553 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:53:56,553 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:53:56,553 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:53:56,553 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:53:56,553 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:53:56,554 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:53:56,554 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:53:56,554 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:53:56,554 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:53:56,555 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:53:56,555 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:53:56,555 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:53:56,555 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:53:56,555 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:53:56,555 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:53:56,600 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:53:56,614 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:53:56,618 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:53:56,620 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:53:56,620 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:53:56,621 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label50_true-unreach-call.c [2018-10-25 01:53:56,689 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/98a284fe4/6b417beea9d048dea8a1d15baaa69bcc/FLAGedb6f692a [2018-10-25 01:53:57,341 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:53:57,342 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label50_true-unreach-call.c [2018-10-25 01:53:57,362 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/98a284fe4/6b417beea9d048dea8a1d15baaa69bcc/FLAGedb6f692a [2018-10-25 01:53:57,379 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/98a284fe4/6b417beea9d048dea8a1d15baaa69bcc [2018-10-25 01:53:57,390 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:53:57,391 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:53:57,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:53:57,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:53:57,397 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:53:57,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:53:57" (1/1) ... [2018-10-25 01:53:57,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b692d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:57, skipping insertion in model container [2018-10-25 01:53:57,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:53:57" (1/1) ... [2018-10-25 01:53:57,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:53:57,495 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:53:58,240 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:53:58,247 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:53:58,571 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:53:58,593 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:53:58,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:58 WrapperNode [2018-10-25 01:53:58,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:53:58,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:53:58,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:53:58,596 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:53:58,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:58" (1/1) ... [2018-10-25 01:53:58,638 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:58" (1/1) ... [2018-10-25 01:53:58,907 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:53:58,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:53:58,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:53:58,908 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:53:58,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:58" (1/1) ... [2018-10-25 01:53:58,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:58" (1/1) ... [2018-10-25 01:53:58,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:58" (1/1) ... [2018-10-25 01:53:58,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:58" (1/1) ... [2018-10-25 01:53:58,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:58" (1/1) ... [2018-10-25 01:53:59,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:58" (1/1) ... [2018-10-25 01:53:59,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:58" (1/1) ... [2018-10-25 01:53:59,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:53:59,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:53:59,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:53:59,067 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:53:59,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-25 01:53:59,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:53:59,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:53:59,140 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:53:59,141 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:53:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:53:59,142 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:53:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:53:59,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:53:59,143 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:53:59,143 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:54:06,289 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:54:06,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:54:06 BoogieIcfgContainer [2018-10-25 01:54:06,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:54:06,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:54:06,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:54:06,295 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:54:06,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:53:57" (1/3) ... [2018-10-25 01:54:06,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433d0341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:54:06, skipping insertion in model container [2018-10-25 01:54:06,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:58" (2/3) ... [2018-10-25 01:54:06,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433d0341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:54:06, skipping insertion in model container [2018-10-25 01:54:06,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:54:06" (3/3) ... [2018-10-25 01:54:06,299 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label50_true-unreach-call.c [2018-10-25 01:54:06,309 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:54:06,317 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:54:06,337 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:54:06,394 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:54:06,395 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:54:06,395 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:54:06,395 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:54:06,395 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:54:06,395 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:54:06,396 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:54:06,396 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:54:06,435 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-10-25 01:54:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-25 01:54:06,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:06,450 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:54:06,452 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:06,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:06,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1374048196, now seen corresponding path program 1 times [2018-10-25 01:54:06,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:06,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:06,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:06,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:06,518 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:07,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:54:07,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:54:07,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:54:07,030 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:07,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:54:07,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:54:07,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:54:07,085 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 4 states. [2018-10-25 01:54:13,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:13,801 INFO L93 Difference]: Finished difference Result 1513 states and 2838 transitions. [2018-10-25 01:54:13,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:54:13,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-10-25 01:54:13,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:13,840 INFO L225 Difference]: With dead ends: 1513 [2018-10-25 01:54:13,841 INFO L226 Difference]: Without dead ends: 1097 [2018-10-25 01:54:13,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:54:13,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-10-25 01:54:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1097. [2018-10-25 01:54:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2018-10-25 01:54:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1954 transitions. [2018-10-25 01:54:13,985 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1954 transitions. Word has length 52 [2018-10-25 01:54:13,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:13,986 INFO L481 AbstractCegarLoop]: Abstraction has 1097 states and 1954 transitions. [2018-10-25 01:54:13,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:54:13,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1954 transitions. [2018-10-25 01:54:13,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-25 01:54:13,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:13,996 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:54:13,996 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:13,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:13,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2033575421, now seen corresponding path program 1 times [2018-10-25 01:54:13,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:13,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:13,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:13,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:13,999 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:14,352 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:54:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:54:14,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:54:14,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:54:14,468 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:14,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:54:14,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:54:14,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:54:14,471 INFO L87 Difference]: Start difference. First operand 1097 states and 1954 transitions. Second operand 6 states. [2018-10-25 01:54:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:21,683 INFO L93 Difference]: Finished difference Result 3259 states and 5952 transitions. [2018-10-25 01:54:21,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:54:21,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2018-10-25 01:54:21,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:21,707 INFO L225 Difference]: With dead ends: 3259 [2018-10-25 01:54:21,707 INFO L226 Difference]: Without dead ends: 2168 [2018-10-25 01:54:21,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:54:21,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2018-10-25 01:54:21,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2142. [2018-10-25 01:54:21,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2142 states. [2018-10-25 01:54:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 3739 transitions. [2018-10-25 01:54:21,821 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 3739 transitions. Word has length 123 [2018-10-25 01:54:21,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:21,822 INFO L481 AbstractCegarLoop]: Abstraction has 2142 states and 3739 transitions. [2018-10-25 01:54:21,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:54:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 3739 transitions. [2018-10-25 01:54:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-25 01:54:21,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:21,836 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:54:21,836 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:21,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:21,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1172506123, now seen corresponding path program 1 times [2018-10-25 01:54:21,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:21,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:21,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:21,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:21,842 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:54:22,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:54:22,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:54:22,141 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:22,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:54:22,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:54:22,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:54:22,143 INFO L87 Difference]: Start difference. First operand 2142 states and 3739 transitions. Second operand 6 states. [2018-10-25 01:54:27,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:27,562 INFO L93 Difference]: Finished difference Result 7053 states and 12688 transitions. [2018-10-25 01:54:27,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:54:27,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2018-10-25 01:54:27,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:27,612 INFO L225 Difference]: With dead ends: 7053 [2018-10-25 01:54:27,612 INFO L226 Difference]: Without dead ends: 4917 [2018-10-25 01:54:27,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:54:27,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4917 states. [2018-10-25 01:54:27,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4917 to 4877. [2018-10-25 01:54:27,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4877 states. [2018-10-25 01:54:27,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4877 states to 4877 states and 7891 transitions. [2018-10-25 01:54:27,806 INFO L78 Accepts]: Start accepts. Automaton has 4877 states and 7891 transitions. Word has length 151 [2018-10-25 01:54:27,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:27,807 INFO L481 AbstractCegarLoop]: Abstraction has 4877 states and 7891 transitions. [2018-10-25 01:54:27,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:54:27,807 INFO L276 IsEmpty]: Start isEmpty. Operand 4877 states and 7891 transitions. [2018-10-25 01:54:27,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-25 01:54:27,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:27,812 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:54:27,815 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:27,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:27,815 INFO L82 PathProgramCache]: Analyzing trace with hash 405483975, now seen corresponding path program 1 times [2018-10-25 01:54:27,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:27,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:27,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:27,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:27,817 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:28,092 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:54:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:54:28,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:54:28,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:54:28,473 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:28,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:54:28,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:54:28,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:54:28,474 INFO L87 Difference]: Start difference. First operand 4877 states and 7891 transitions. Second operand 6 states. [2018-10-25 01:54:32,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:32,397 INFO L93 Difference]: Finished difference Result 11909 states and 19972 transitions. [2018-10-25 01:54:32,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:54:32,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 169 [2018-10-25 01:54:32,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:32,448 INFO L225 Difference]: With dead ends: 11909 [2018-10-25 01:54:32,448 INFO L226 Difference]: Without dead ends: 7038 [2018-10-25 01:54:32,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:54:32,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7038 states. [2018-10-25 01:54:32,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7038 to 6977. [2018-10-25 01:54:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6977 states. [2018-10-25 01:54:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6977 states to 6977 states and 9942 transitions. [2018-10-25 01:54:32,731 INFO L78 Accepts]: Start accepts. Automaton has 6977 states and 9942 transitions. Word has length 169 [2018-10-25 01:54:32,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:32,732 INFO L481 AbstractCegarLoop]: Abstraction has 6977 states and 9942 transitions. [2018-10-25 01:54:32,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:54:32,732 INFO L276 IsEmpty]: Start isEmpty. Operand 6977 states and 9942 transitions. [2018-10-25 01:54:32,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-25 01:54:32,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:32,738 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:54:32,739 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:32,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:32,739 INFO L82 PathProgramCache]: Analyzing trace with hash 573454830, now seen corresponding path program 1 times [2018-10-25 01:54:32,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:32,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:32,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:32,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:32,741 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:33,076 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:54:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:54:33,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:54:33,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:54:33,627 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:33,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:54:33,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:54:33,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:54:33,629 INFO L87 Difference]: Start difference. First operand 6977 states and 9942 transitions. Second operand 6 states. [2018-10-25 01:54:38,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:38,060 INFO L93 Difference]: Finished difference Result 17711 states and 25505 transitions. [2018-10-25 01:54:38,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:54:38,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 216 [2018-10-25 01:54:38,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:38,130 INFO L225 Difference]: With dead ends: 17711 [2018-10-25 01:54:38,130 INFO L226 Difference]: Without dead ends: 10740 [2018-10-25 01:54:38,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:54:38,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10740 states. [2018-10-25 01:54:38,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10740 to 10702. [2018-10-25 01:54:38,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10702 states. [2018-10-25 01:54:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10702 states to 10702 states and 14504 transitions. [2018-10-25 01:54:38,467 INFO L78 Accepts]: Start accepts. Automaton has 10702 states and 14504 transitions. Word has length 216 [2018-10-25 01:54:38,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:38,467 INFO L481 AbstractCegarLoop]: Abstraction has 10702 states and 14504 transitions. [2018-10-25 01:54:38,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:54:38,468 INFO L276 IsEmpty]: Start isEmpty. Operand 10702 states and 14504 transitions. [2018-10-25 01:54:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-25 01:54:38,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:38,475 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:54:38,475 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:38,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:38,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1283886317, now seen corresponding path program 1 times [2018-10-25 01:54:38,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:38,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:38,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:38,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:38,477 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-25 01:54:38,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:54:38,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:54:38,755 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:38,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:54:38,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:54:38,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:54:38,758 INFO L87 Difference]: Start difference. First operand 10702 states and 14504 transitions. Second operand 4 states. [2018-10-25 01:54:43,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:43,793 INFO L93 Difference]: Finished difference Result 27183 states and 37572 transitions. [2018-10-25 01:54:43,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:54:43,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 253 [2018-10-25 01:54:43,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:43,867 INFO L225 Difference]: With dead ends: 27183 [2018-10-25 01:54:43,867 INFO L226 Difference]: Without dead ends: 16487 [2018-10-25 01:54:43,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:54:43,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16487 states. [2018-10-25 01:54:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16487 to 16487. [2018-10-25 01:54:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16487 states. [2018-10-25 01:54:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16487 states to 16487 states and 21483 transitions. [2018-10-25 01:54:44,328 INFO L78 Accepts]: Start accepts. Automaton has 16487 states and 21483 transitions. Word has length 253 [2018-10-25 01:54:44,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:44,329 INFO L481 AbstractCegarLoop]: Abstraction has 16487 states and 21483 transitions. [2018-10-25 01:54:44,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:54:44,329 INFO L276 IsEmpty]: Start isEmpty. Operand 16487 states and 21483 transitions. [2018-10-25 01:54:44,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-10-25 01:54:44,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:44,370 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:54:44,370 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:44,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:44,370 INFO L82 PathProgramCache]: Analyzing trace with hash -207588909, now seen corresponding path program 1 times [2018-10-25 01:54:44,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:44,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:44,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:44,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:44,377 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 254 proven. 115 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-10-25 01:54:45,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:54:45,116 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:54:45,118 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 438 with the following transitions: [2018-10-25 01:54:45,120 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [495], [497], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [856], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [912], [913], [917], [921], [925], [929], [933], [937], [941], [945], [948], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-10-25 01:54:45,180 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:54:45,180 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:54:45,769 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:54:45,774 INFO L272 AbstractInterpreter]: Visited 145 different actions 145 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 01:54:45,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:45,818 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:54:46,797 INFO L232 lantSequenceWeakener]: Weakened 425 states. On average, predicates are now at 77.68% of their original sizes. [2018-10-25 01:54:46,797 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:54:46,999 INFO L413 sIntCurrentIteration]: We have 436 unified AI predicates [2018-10-25 01:54:47,000 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:54:47,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:54:47,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:54:47,001 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:47,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:54:47,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:54:47,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:54:47,002 INFO L87 Difference]: Start difference. First operand 16487 states and 21483 transitions. Second operand 6 states. [2018-10-25 01:55:10,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:55:10,633 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 01:55:10,640 INFO L168 Benchmark]: Toolchain (without parser) took 73248.99 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -376.4 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-25 01:55:10,641 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:55:10,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1202.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:55:10,642 INFO L168 Benchmark]: Boogie Procedure Inliner took 312.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -874.8 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:55:10,643 INFO L168 Benchmark]: Boogie Preprocessor took 157.82 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:55:10,644 INFO L168 Benchmark]: RCFGBuilder took 7223.69 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 271.2 MB). Peak memory consumption was 271.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:55:10,645 INFO L168 Benchmark]: TraceAbstraction took 64347.56 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 128.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-10-25 01:55:10,651 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1202.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 312.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -874.8 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 157.82 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7223.69 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 271.2 MB). Peak memory consumption was 271.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 64347.56 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 128.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...