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/Problem15_label42_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:49:38,990 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:49:38,992 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:49:39,005 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:49:39,007 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:49:39,008 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:49:39,011 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:49:39,013 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:49:39,017 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:49:39,019 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:49:39,020 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:49:39,020 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:49:39,023 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:49:39,025 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:49:39,026 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:49:39,027 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:49:39,029 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:49:39,036 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:49:39,041 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:49:39,043 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:49:39,045 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:49:39,046 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:49:39,050 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:49:39,050 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:49:39,050 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:49:39,051 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:49:39,054 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:49:39,056 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:49:39,057 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:49:39,058 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:49:39,058 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:49:39,061 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:49:39,061 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:49:39,061 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:49:39,062 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:49:39,063 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:49:39,063 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:49:39,089 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:49:39,089 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:49:39,091 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:49:39,091 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:49:39,091 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:49:39,091 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:49:39,092 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:49:39,092 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:49:39,092 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:49:39,092 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:49:39,092 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:49:39,093 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:49:39,093 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:49:39,093 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:49:39,094 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:49:39,094 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:49:39,095 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:49:39,095 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:49:39,095 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:49:39,095 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:49:39,095 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:49:39,096 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:49:39,097 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:49:39,098 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:49:39,098 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:49:39,098 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:49:39,098 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:49:39,098 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:49:39,099 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:49:39,099 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:49:39,099 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:49:39,099 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:49:39,099 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:49:39,100 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:49:39,100 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:49:39,100 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:49:39,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:49:39,164 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:49:39,170 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:49:39,171 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:49:39,172 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:49:39,173 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label42_true-unreach-call.c [2018-10-25 01:49:39,234 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d9caa5e0a/80abc75089f041bcadbb7afdb69af987/FLAGba1e771e4 [2018-10-25 01:49:39,900 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:49:39,901 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label42_true-unreach-call.c [2018-10-25 01:49:39,919 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d9caa5e0a/80abc75089f041bcadbb7afdb69af987/FLAGba1e771e4 [2018-10-25 01:49:39,935 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d9caa5e0a/80abc75089f041bcadbb7afdb69af987 [2018-10-25 01:49:39,947 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:49:39,948 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:49:39,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:49:39,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:49:39,956 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:49:39,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:49:39" (1/1) ... [2018-10-25 01:49:39,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@116b2aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:49:39, skipping insertion in model container [2018-10-25 01:49:39,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:49:39" (1/1) ... [2018-10-25 01:49:39,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:49:40,076 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:49:40,855 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:49:40,860 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:49:41,148 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:49:41,171 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:49:41,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:49:41 WrapperNode [2018-10-25 01:49:41,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:49:41,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:49:41,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:49:41,173 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:49:41,185 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:49:41" (1/1) ... [2018-10-25 01:49:41,238 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:49:41" (1/1) ... [2018-10-25 01:49:41,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:49:41,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:49:41,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:49:41,544 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:49:41,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:49:41" (1/1) ... [2018-10-25 01:49:41,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:49:41" (1/1) ... [2018-10-25 01:49:41,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:49:41" (1/1) ... [2018-10-25 01:49:41,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:49:41" (1/1) ... [2018-10-25 01:49:41,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:49:41" (1/1) ... [2018-10-25 01:49:41,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:49:41" (1/1) ... [2018-10-25 01:49:41,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:49:41" (1/1) ... [2018-10-25 01:49:41,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:49:41,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:49:41,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:49:41,763 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:49:41,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:49:41" (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:49:41,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:49:41,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:49:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:49:41,835 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:49:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:49:41,835 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:49:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:49:41,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:49:41,836 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:49:41,836 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:49:49,865 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:49:49,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:49:49 BoogieIcfgContainer [2018-10-25 01:49:49,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:49:49,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:49:49,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:49:49,873 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:49:49,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:49:39" (1/3) ... [2018-10-25 01:49:49,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa1368b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:49:49, skipping insertion in model container [2018-10-25 01:49:49,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:49:41" (2/3) ... [2018-10-25 01:49:49,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa1368b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:49:49, skipping insertion in model container [2018-10-25 01:49:49,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:49:49" (3/3) ... [2018-10-25 01:49:49,877 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label42_true-unreach-call.c [2018-10-25 01:49:49,887 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:49:49,896 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:49:49,914 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:49:49,956 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:49:49,956 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:49:49,956 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:49:49,956 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:49:49,956 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:49:49,957 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:49:49,957 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:49:49,957 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:49:49,988 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states. [2018-10-25 01:49:49,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-25 01:49:49,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:49:50,000 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, 1] [2018-10-25 01:49:50,003 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:49:50,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:49:50,011 INFO L82 PathProgramCache]: Analyzing trace with hash 592671889, now seen corresponding path program 1 times [2018-10-25 01:49:50,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:49:50,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:49:50,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:49:50,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:49:50,073 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:49:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:49:50,546 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-10-25 01:49:50,583 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:49:50,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:49:50,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:49:50,586 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:49:50,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:49:50,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:49:50,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:49:50,613 INFO L87 Difference]: Start difference. First operand 438 states. Second operand 4 states. [2018-10-25 01:50:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:50:01,689 INFO L93 Difference]: Finished difference Result 1558 states and 2849 transitions. [2018-10-25 01:50:01,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:50:01,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-10-25 01:50:01,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:50:01,720 INFO L225 Difference]: With dead ends: 1558 [2018-10-25 01:50:01,720 INFO L226 Difference]: Without dead ends: 1114 [2018-10-25 01:50:01,733 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:50:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2018-10-25 01:50:01,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1091. [2018-10-25 01:50:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1091 states. [2018-10-25 01:50:01,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1853 transitions. [2018-10-25 01:50:01,898 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1853 transitions. Word has length 53 [2018-10-25 01:50:01,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:50:01,899 INFO L481 AbstractCegarLoop]: Abstraction has 1091 states and 1853 transitions. [2018-10-25 01:50:01,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:50:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1853 transitions. [2018-10-25 01:50:01,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-25 01:50:01,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:50:01,917 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, 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] [2018-10-25 01:50:01,917 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:50:01,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:50:01,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1626960388, now seen corresponding path program 1 times [2018-10-25 01:50:01,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:50:01,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:50:01,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:50:01,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:50:01,923 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:50:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:50:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:50:02,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:50:02,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:50:02,265 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:50:02,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:50:02,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:50:02,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:50:02,270 INFO L87 Difference]: Start difference. First operand 1091 states and 1853 transitions. Second operand 5 states. [2018-10-25 01:50:09,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:50:09,809 INFO L93 Difference]: Finished difference Result 3240 states and 5580 transitions. [2018-10-25 01:50:09,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:50:09,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2018-10-25 01:50:09,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:50:09,838 INFO L225 Difference]: With dead ends: 3240 [2018-10-25 01:50:09,838 INFO L226 Difference]: Without dead ends: 2155 [2018-10-25 01:50:09,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:50:09,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2018-10-25 01:50:09,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 2114. [2018-10-25 01:50:09,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2018-10-25 01:50:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 3176 transitions. [2018-10-25 01:50:09,923 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 3176 transitions. Word has length 126 [2018-10-25 01:50:09,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:50:09,924 INFO L481 AbstractCegarLoop]: Abstraction has 2114 states and 3176 transitions. [2018-10-25 01:50:09,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:50:09,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 3176 transitions. [2018-10-25 01:50:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-25 01:50:09,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:50:09,928 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, 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] [2018-10-25 01:50:09,929 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:50:09,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:50:09,929 INFO L82 PathProgramCache]: Analyzing trace with hash 108586508, now seen corresponding path program 1 times [2018-10-25 01:50:09,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:50:09,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:50:09,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:50:09,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:50:09,931 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:50:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:50:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:50:10,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:50:10,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:50:10,198 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:50:10,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:50:10,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:50:10,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:50:10,201 INFO L87 Difference]: Start difference. First operand 2114 states and 3176 transitions. Second operand 4 states. [2018-10-25 01:50:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:50:17,607 INFO L93 Difference]: Finished difference Result 7944 states and 12443 transitions. [2018-10-25 01:50:17,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:50:17,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2018-10-25 01:50:17,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:50:17,648 INFO L225 Difference]: With dead ends: 7944 [2018-10-25 01:50:17,648 INFO L226 Difference]: Without dead ends: 5836 [2018-10-25 01:50:17,674 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:50:17,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5836 states. [2018-10-25 01:50:17,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5836 to 5834. [2018-10-25 01:50:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5834 states. [2018-10-25 01:50:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5834 states to 5834 states and 8173 transitions. [2018-10-25 01:50:17,835 INFO L78 Accepts]: Start accepts. Automaton has 5834 states and 8173 transitions. Word has length 134 [2018-10-25 01:50:17,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:50:17,835 INFO L481 AbstractCegarLoop]: Abstraction has 5834 states and 8173 transitions. [2018-10-25 01:50:17,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:50:17,836 INFO L276 IsEmpty]: Start isEmpty. Operand 5834 states and 8173 transitions. [2018-10-25 01:50:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-25 01:50:17,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:50:17,847 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:17,847 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:50:17,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:50:17,848 INFO L82 PathProgramCache]: Analyzing trace with hash 2141238506, now seen corresponding path program 1 times [2018-10-25 01:50:17,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:50:17,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:50:17,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:50:17,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:50:17,849 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:50:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:50:18,154 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:50:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 92 proven. 65 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:50:18,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:50:18,369 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:50:18,370 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-10-25 01:50:18,372 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [397], [399], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [566], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [714], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-10-25 01:50:18,421 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:50:18,421 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:50:19,160 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:50:19,161 INFO L272 AbstractInterpreter]: Visited 105 different actions 105 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 01:50:19,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:50:19,205 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:50:19,819 INFO L232 lantSequenceWeakener]: Weakened 214 states. On average, predicates are now at 78.05% of their original sizes. [2018-10-25 01:50:19,820 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:50:20,080 INFO L413 sIntCurrentIteration]: We have 222 unified AI predicates [2018-10-25 01:50:20,080 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:50:20,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:50:20,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:50:20,081 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:50:20,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:50:20,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:50:20,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:50:20,083 INFO L87 Difference]: Start difference. First operand 5834 states and 8173 transitions. Second operand 6 states. [2018-10-25 01:50:47,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:50:47,862 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: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:50:47,867 INFO L168 Benchmark]: Toolchain (without parser) took 67919.54 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-25 01:50:47,869 INFO L168 Benchmark]: CDTParser took 0.22 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:50:47,869 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1222.75 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: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:50:47,870 INFO L168 Benchmark]: Boogie Procedure Inliner took 370.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 778.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -895.1 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:50:47,871 INFO L168 Benchmark]: Boogie Preprocessor took 218.13 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: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:50:47,872 INFO L168 Benchmark]: RCFGBuilder took 8103.55 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: 314.1 MB). Peak memory consumption was 314.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:50:47,873 INFO L168 Benchmark]: TraceAbstraction took 57998.66 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 3.0 GB in the end (delta: -1.2 GB). Peak memory consumption was 702.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:50:47,879 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.22 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 1222.75 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: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 370.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 778.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -895.1 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 218.13 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: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8103.55 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: 314.1 MB). Peak memory consumption was 314.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57998.66 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 3.0 GB in the end (delta: -1.2 GB). Peak memory consumption was 702.3 MB. 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...