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_label10_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:51:54,662 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:51:54,664 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:51:54,677 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:51:54,677 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:51:54,678 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:51:54,679 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:51:54,681 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:51:54,683 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:51:54,684 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:51:54,685 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:51:54,687 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:51:54,688 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:51:54,691 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:51:54,692 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:51:54,693 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:51:54,700 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:51:54,704 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:51:54,706 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:51:54,709 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:51:54,710 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:51:54,713 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:51:54,716 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:51:54,717 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:51:54,717 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:51:54,718 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:51:54,720 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:51:54,721 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:51:54,725 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:51:54,726 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:51:54,727 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:51:54,729 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:51:54,730 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:51:54,731 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:51:54,732 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:51:54,734 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:51:54,734 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:51:54,763 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:51:54,763 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:51:54,764 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:51:54,765 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:51:54,765 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:51:54,765 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:51:54,765 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:51:54,765 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:51:54,765 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:51:54,766 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:51:54,766 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:51:54,766 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:51:54,766 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:51:54,766 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:51:54,767 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:51:54,767 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:51:54,768 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:51:54,768 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:51:54,768 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:51:54,768 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:51:54,768 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:51:54,769 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:51:54,769 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:51:54,769 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:51:54,769 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:51:54,769 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:51:54,770 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:51:54,770 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:51:54,770 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:51:54,770 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:51:54,770 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:51:54,771 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:51:54,771 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:51:54,771 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:51:54,771 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:51:54,771 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:51:54,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:51:54,833 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:51:54,838 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:51:54,840 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:51:54,840 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:51:54,841 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label10_true-unreach-call.c [2018-10-25 01:51:54,911 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4003cda82/13f82773e006403ba172be252cb09fad/FLAG89127048f [2018-10-25 01:51:55,580 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:51:55,580 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label10_true-unreach-call.c [2018-10-25 01:51:55,600 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4003cda82/13f82773e006403ba172be252cb09fad/FLAG89127048f [2018-10-25 01:51:55,615 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4003cda82/13f82773e006403ba172be252cb09fad [2018-10-25 01:51:55,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:51:55,628 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:51:55,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:51:55,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:51:55,633 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:51:55,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:51:55" (1/1) ... [2018-10-25 01:51:55,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f158897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:55, skipping insertion in model container [2018-10-25 01:51:55,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:51:55" (1/1) ... [2018-10-25 01:51:55,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:51:55,727 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:51:56,548 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:51:56,552 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:51:56,823 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:51:56,845 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:51:56,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:56 WrapperNode [2018-10-25 01:51:56,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:51:56,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:51:56,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:51:56,847 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:51:56,857 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:51:56" (1/1) ... [2018-10-25 01:51:56,918 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:51:56" (1/1) ... [2018-10-25 01:51:57,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:51:57,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:51:57,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:51:57,203 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:51:57,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:56" (1/1) ... [2018-10-25 01:51:57,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:56" (1/1) ... [2018-10-25 01:51:57,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:56" (1/1) ... [2018-10-25 01:51:57,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:56" (1/1) ... [2018-10-25 01:51:57,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:56" (1/1) ... [2018-10-25 01:51:57,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:56" (1/1) ... [2018-10-25 01:51:57,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:56" (1/1) ... [2018-10-25 01:51:57,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:51:57,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:51:57,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:51:57,356 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:51:57,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:56" (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:51:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:51:57,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:51:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:51:57,424 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:51:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:51:57,424 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:51:57,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:51:57,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:51:57,425 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:51:57,425 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:52:05,746 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:52:05,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:52:05 BoogieIcfgContainer [2018-10-25 01:52:05,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:52:05,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:52:05,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:52:05,755 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:52:05,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:51:55" (1/3) ... [2018-10-25 01:52:05,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55973540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:52:05, skipping insertion in model container [2018-10-25 01:52:05,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:56" (2/3) ... [2018-10-25 01:52:05,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55973540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:52:05, skipping insertion in model container [2018-10-25 01:52:05,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:52:05" (3/3) ... [2018-10-25 01:52:05,759 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label10_true-unreach-call.c [2018-10-25 01:52:05,769 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:52:05,778 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:52:05,796 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:52:05,838 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:52:05,838 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:52:05,838 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:52:05,838 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:52:05,838 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:52:05,839 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:52:05,839 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:52:05,839 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:52:05,875 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-10-25 01:52:05,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-25 01:52:05,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:05,889 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] [2018-10-25 01:52:05,891 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:05,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:05,898 INFO L82 PathProgramCache]: Analyzing trace with hash -369179421, now seen corresponding path program 1 times [2018-10-25 01:52:05,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:05,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:05,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:05,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:05,951 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:06,364 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-10-25 01:52:06,381 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:52:06,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:06,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:52:06,384 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:06,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:52:06,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:52:06,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:52:06,410 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 4 states. [2018-10-25 01:52:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:15,959 INFO L93 Difference]: Finished difference Result 1513 states and 2838 transitions. [2018-10-25 01:52:15,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:52:15,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-10-25 01:52:15,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:15,995 INFO L225 Difference]: With dead ends: 1513 [2018-10-25 01:52:15,996 INFO L226 Difference]: Without dead ends: 1097 [2018-10-25 01:52:16,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:52:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-10-25 01:52:16,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1097. [2018-10-25 01:52:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2018-10-25 01:52:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1954 transitions. [2018-10-25 01:52:16,126 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1954 transitions. Word has length 39 [2018-10-25 01:52:16,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:16,127 INFO L481 AbstractCegarLoop]: Abstraction has 1097 states and 1954 transitions. [2018-10-25 01:52:16,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:52:16,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1954 transitions. [2018-10-25 01:52:16,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-25 01:52:16,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:16,136 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:16,136 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:16,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:16,137 INFO L82 PathProgramCache]: Analyzing trace with hash -820358275, now seen corresponding path program 1 times [2018-10-25 01:52:16,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:16,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:16,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:16,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:16,139 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:16,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:16,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:16,510 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:16,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:16,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:16,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:16,513 INFO L87 Difference]: Start difference. First operand 1097 states and 1954 transitions. Second operand 6 states. [2018-10-25 01:52:23,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:23,922 INFO L93 Difference]: Finished difference Result 3259 states and 5952 transitions. [2018-10-25 01:52:23,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:52:23,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-10-25 01:52:23,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:23,945 INFO L225 Difference]: With dead ends: 3259 [2018-10-25 01:52:23,945 INFO L226 Difference]: Without dead ends: 2168 [2018-10-25 01:52:23,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:52:23,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2018-10-25 01:52:24,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2142. [2018-10-25 01:52:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2142 states. [2018-10-25 01:52:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 3739 transitions. [2018-10-25 01:52:24,066 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 3739 transitions. Word has length 110 [2018-10-25 01:52:24,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:24,067 INFO L481 AbstractCegarLoop]: Abstraction has 2142 states and 3739 transitions. [2018-10-25 01:52:24,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:52:24,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 3739 transitions. [2018-10-25 01:52:24,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-25 01:52:24,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:24,075 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:24,075 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:24,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:24,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1928773899, now seen corresponding path program 1 times [2018-10-25 01:52:24,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:24,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:24,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:24,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:24,077 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:24,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:24,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:24,444 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:24,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:24,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:24,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:24,447 INFO L87 Difference]: Start difference. First operand 2142 states and 3739 transitions. Second operand 6 states. [2018-10-25 01:52:29,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:29,788 INFO L93 Difference]: Finished difference Result 7053 states and 12688 transitions. [2018-10-25 01:52:29,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:52:29,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2018-10-25 01:52:29,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:29,836 INFO L225 Difference]: With dead ends: 7053 [2018-10-25 01:52:29,836 INFO L226 Difference]: Without dead ends: 4917 [2018-10-25 01:52:29,859 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:52:29,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4917 states. [2018-10-25 01:52:29,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4917 to 4877. [2018-10-25 01:52:29,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4877 states. [2018-10-25 01:52:30,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4877 states to 4877 states and 7891 transitions. [2018-10-25 01:52:30,006 INFO L78 Accepts]: Start accepts. Automaton has 4877 states and 7891 transitions. Word has length 138 [2018-10-25 01:52:30,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:30,007 INFO L481 AbstractCegarLoop]: Abstraction has 4877 states and 7891 transitions. [2018-10-25 01:52:30,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:52:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 4877 states and 7891 transitions. [2018-10-25 01:52:30,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-25 01:52:30,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:30,010 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:30,010 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:30,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:30,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1730052985, now seen corresponding path program 1 times [2018-10-25 01:52:30,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:30,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:30,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:30,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:30,012 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:30,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:30,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:30,243 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:30,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:30,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:30,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:30,245 INFO L87 Difference]: Start difference. First operand 4877 states and 7891 transitions. Second operand 6 states. [2018-10-25 01:52:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:34,070 INFO L93 Difference]: Finished difference Result 11909 states and 19972 transitions. [2018-10-25 01:52:34,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:52:34,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2018-10-25 01:52:34,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:34,125 INFO L225 Difference]: With dead ends: 11909 [2018-10-25 01:52:34,126 INFO L226 Difference]: Without dead ends: 7038 [2018-10-25 01:52:34,155 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:52:34,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7038 states. [2018-10-25 01:52:34,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7038 to 6977. [2018-10-25 01:52:34,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6977 states. [2018-10-25 01:52:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6977 states to 6977 states and 9942 transitions. [2018-10-25 01:52:34,375 INFO L78 Accepts]: Start accepts. Automaton has 6977 states and 9942 transitions. Word has length 156 [2018-10-25 01:52:34,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:34,376 INFO L481 AbstractCegarLoop]: Abstraction has 6977 states and 9942 transitions. [2018-10-25 01:52:34,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:52:34,376 INFO L276 IsEmpty]: Start isEmpty. Operand 6977 states and 9942 transitions. [2018-10-25 01:52:34,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-25 01:52:34,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:34,382 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:34,382 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:34,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:34,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1129340368, now seen corresponding path program 1 times [2018-10-25 01:52:34,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:34,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:34,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:34,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:34,384 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:34,678 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:52:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:35,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:35,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:35,161 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:35,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:35,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:35,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:35,163 INFO L87 Difference]: Start difference. First operand 6977 states and 9942 transitions. Second operand 6 states. [2018-10-25 01:52:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:41,164 INFO L93 Difference]: Finished difference Result 17709 states and 25496 transitions. [2018-10-25 01:52:41,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:52:41,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2018-10-25 01:52:41,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:41,229 INFO L225 Difference]: With dead ends: 17709 [2018-10-25 01:52:41,229 INFO L226 Difference]: Without dead ends: 10738 [2018-10-25 01:52:41,272 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:52:41,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10738 states. [2018-10-25 01:52:41,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10738 to 10702. [2018-10-25 01:52:41,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10702 states. [2018-10-25 01:52:41,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10702 states to 10702 states and 14504 transitions. [2018-10-25 01:52:41,538 INFO L78 Accepts]: Start accepts. Automaton has 10702 states and 14504 transitions. Word has length 203 [2018-10-25 01:52:41,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:41,539 INFO L481 AbstractCegarLoop]: Abstraction has 10702 states and 14504 transitions. [2018-10-25 01:52:41,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:52:41,539 INFO L276 IsEmpty]: Start isEmpty. Operand 10702 states and 14504 transitions. [2018-10-25 01:52:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-25 01:52:41,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:41,544 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, 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] [2018-10-25 01:52:41,544 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:41,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:41,545 INFO L82 PathProgramCache]: Analyzing trace with hash 2083831764, now seen corresponding path program 1 times [2018-10-25 01:52:41,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:41,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:41,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:41,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:41,546 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-25 01:52:41,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:41,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:52:41,822 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:41,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:52:41,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:52:41,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:52:41,824 INFO L87 Difference]: Start difference. First operand 10702 states and 14504 transitions. Second operand 4 states. [2018-10-25 01:52:46,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:46,141 INFO L93 Difference]: Finished difference Result 27183 states and 37572 transitions. [2018-10-25 01:52:46,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:52:46,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2018-10-25 01:52:46,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:46,216 INFO L225 Difference]: With dead ends: 27183 [2018-10-25 01:52:46,217 INFO L226 Difference]: Without dead ends: 16487 [2018-10-25 01:52:46,254 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:52:46,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16487 states. [2018-10-25 01:52:46,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16487 to 16487. [2018-10-25 01:52:46,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16487 states. [2018-10-25 01:52:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16487 states to 16487 states and 21483 transitions. [2018-10-25 01:52:46,603 INFO L78 Accepts]: Start accepts. Automaton has 16487 states and 21483 transitions. Word has length 240 [2018-10-25 01:52:46,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:46,603 INFO L481 AbstractCegarLoop]: Abstraction has 16487 states and 21483 transitions. [2018-10-25 01:52:46,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:52:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 16487 states and 21483 transitions. [2018-10-25 01:52:46,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-10-25 01:52:46,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:46,638 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, 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, 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:52:46,639 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:46,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:46,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1463225967, now seen corresponding path program 1 times [2018-10-25 01:52:46,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:46,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:46,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:46,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:46,644 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:47,087 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 215 proven. 115 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-10-25 01:52:47,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:52:47,088 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:52:47,089 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 425 with the following transitions: [2018-10-25 01:52:47,091 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], [391], [393], [396], [404], [412], [420], [428], [436], [444], [452], [460], [468], [476], [484], [492], [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:52:47,145 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:52:47,145 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:52:47,824 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:52:47,830 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:52:47,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:47,870 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:52:48,703 INFO L232 lantSequenceWeakener]: Weakened 412 states. On average, predicates are now at 77.55% of their original sizes. [2018-10-25 01:52:48,704 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:52:48,968 INFO L413 sIntCurrentIteration]: We have 423 unified AI predicates [2018-10-25 01:52:48,968 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:52:48,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:52:48,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:52:48,970 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:48,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:48,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:48,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:48,971 INFO L87 Difference]: Start difference. First operand 16487 states and 21483 transitions. Second operand 6 states. [2018-10-25 01:53:04,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:53:04,850 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:53:04,856 INFO L168 Benchmark]: Toolchain (without parser) took 69228.91 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -134.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-25 01:53:04,857 INFO L168 Benchmark]: CDTParser took 0.21 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:53:04,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1217.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 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:53:04,860 INFO L168 Benchmark]: Boogie Procedure Inliner took 355.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -854.7 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:53:04,863 INFO L168 Benchmark]: Boogie Preprocessor took 152.80 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: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:53:04,865 INFO L168 Benchmark]: RCFGBuilder took 8392.81 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: 251.6 MB). Peak memory consumption was 251.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:53:04,866 INFO L168 Benchmark]: TraceAbstraction took 59105.93 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 1.9 GB in the beginning and 1.6 GB in the end (delta: 370.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-25 01:53:04,874 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1217.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 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 355.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -854.7 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 152.80 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: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8392.81 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: 251.6 MB). Peak memory consumption was 251.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 59105.93 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 1.9 GB in the beginning and 1.6 GB in the end (delta: 370.3 MB). Peak memory consumption was 1.6 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...