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/Problem13_label49_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:43:57,750 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:43:57,752 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:43:57,765 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:43:57,765 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:43:57,766 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:43:57,767 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:43:57,769 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:43:57,771 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:43:57,771 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:43:57,772 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:43:57,773 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:43:57,774 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:43:57,774 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:43:57,776 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:43:57,776 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:43:57,777 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:43:57,779 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:43:57,781 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:43:57,783 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:43:57,784 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:43:57,785 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:43:57,789 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:43:57,791 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:43:57,791 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:43:57,792 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:43:57,793 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:43:57,797 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:43:57,798 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:43:57,801 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:43:57,801 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:43:57,802 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:43:57,802 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:43:57,802 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:43:57,803 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:43:57,806 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:43:57,806 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:43:57,835 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:43:57,835 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:43:57,836 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:43:57,836 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:43:57,836 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:43:57,836 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:43:57,836 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:43:57,837 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:43:57,838 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:43:57,838 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:43:57,838 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:43:57,838 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:43:57,838 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:43:57,839 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:43:57,839 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:43:57,840 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:43:57,840 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:43:57,840 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:43:57,840 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:43:57,840 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:43:57,841 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:43:57,841 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:43:57,841 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:43:57,841 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:43:57,841 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:43:57,842 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:43:57,843 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:43:57,843 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:43:57,844 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:43:57,844 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:43:57,844 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:43:57,844 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:43:57,844 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:43:57,845 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:43:57,845 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:43:57,846 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:43:57,907 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:43:57,924 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:43:57,928 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:43:57,930 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:43:57,931 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:43:57,931 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label49_true-unreach-call.c [2018-10-25 01:43:57,999 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/13fa6f9b1/ddde75f8128f461d921d2d7cb2686257/FLAG01830a8d8 [2018-10-25 01:43:58,821 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:43:58,822 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label49_true-unreach-call.c [2018-10-25 01:43:58,853 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/13fa6f9b1/ddde75f8128f461d921d2d7cb2686257/FLAG01830a8d8 [2018-10-25 01:43:58,871 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/13fa6f9b1/ddde75f8128f461d921d2d7cb2686257 [2018-10-25 01:43:58,885 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:43:58,888 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:43:58,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:43:58,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:43:58,896 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:43:58,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:43:58" (1/1) ... [2018-10-25 01:43:58,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@357ab04a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:43:58, skipping insertion in model container [2018-10-25 01:43:58,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:43:58" (1/1) ... [2018-10-25 01:43:58,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:43:59,094 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:44:00,532 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:44:00,537 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:44:01,316 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:44:01,351 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:44:01,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01 WrapperNode [2018-10-25 01:44:01,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:44:01,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:44:01,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:44:01,353 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:44:01,362 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:44:01" (1/1) ... [2018-10-25 01:44:01,428 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:44:01" (1/1) ... [2018-10-25 01:44:01,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:44:01,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:44:01,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:44:01,892 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:44:01,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01" (1/1) ... [2018-10-25 01:44:01,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01" (1/1) ... [2018-10-25 01:44:01,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01" (1/1) ... [2018-10-25 01:44:01,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01" (1/1) ... [2018-10-25 01:44:02,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01" (1/1) ... [2018-10-25 01:44:02,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01" (1/1) ... [2018-10-25 01:44:02,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01" (1/1) ... [2018-10-25 01:44:02,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:44:02,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:44:02,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:44:02,210 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:44:02,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01" (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:44:02,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:44:02,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:44:02,283 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:44:02,283 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:44:02,283 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:44:02,283 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:44:02,283 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:44:02,284 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:44:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:44:02,284 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:44:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:44:02,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:44:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:44:02,285 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:44:13,045 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:44:13,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:44:13 BoogieIcfgContainer [2018-10-25 01:44:13,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:44:13,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:44:13,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:44:13,050 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:44:13,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:43:58" (1/3) ... [2018-10-25 01:44:13,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e327290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:44:13, skipping insertion in model container [2018-10-25 01:44:13,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01" (2/3) ... [2018-10-25 01:44:13,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e327290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:44:13, skipping insertion in model container [2018-10-25 01:44:13,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:44:13" (3/3) ... [2018-10-25 01:44:13,054 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label49_true-unreach-call.c [2018-10-25 01:44:13,064 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:44:13,077 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:44:13,094 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:44:13,161 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:44:13,161 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:44:13,162 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:44:13,162 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:44:13,162 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:44:13,162 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:44:13,162 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:44:13,162 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:44:13,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-25 01:44:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-25 01:44:13,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:44:13,218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:44:13,221 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:44:13,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:44:13,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1815238907, now seen corresponding path program 1 times [2018-10-25 01:44:13,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:44:13,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:13,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:44:13,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:13,292 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:44:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:44:13,791 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:44:13,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:44:13,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:44:13,794 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:44:13,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:44:13,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:44:13,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:44:13,819 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 4 states. [2018-10-25 01:44:27,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:44:27,375 INFO L93 Difference]: Finished difference Result 4063 states and 7611 transitions. [2018-10-25 01:44:27,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:44:27,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-10-25 01:44:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:44:27,436 INFO L225 Difference]: With dead ends: 4063 [2018-10-25 01:44:27,436 INFO L226 Difference]: Without dead ends: 2937 [2018-10-25 01:44:27,454 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:44:27,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2018-10-25 01:44:27,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1982. [2018-10-25 01:44:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2018-10-25 01:44:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 3456 transitions. [2018-10-25 01:44:27,655 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 3456 transitions. Word has length 65 [2018-10-25 01:44:27,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:44:27,656 INFO L481 AbstractCegarLoop]: Abstraction has 1982 states and 3456 transitions. [2018-10-25 01:44:27,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:44:27,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 3456 transitions. [2018-10-25 01:44:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-25 01:44:27,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:44:27,665 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, 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] [2018-10-25 01:44:27,665 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:44:27,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:44:27,666 INFO L82 PathProgramCache]: Analyzing trace with hash -617731529, now seen corresponding path program 1 times [2018-10-25 01:44:27,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:44:27,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:27,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:44:27,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:27,668 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:44:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:44:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:44:28,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:44:28,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:44:28,018 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:44:28,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:44:28,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:44:28,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:44:28,021 INFO L87 Difference]: Start difference. First operand 1982 states and 3456 transitions. Second operand 6 states. [2018-10-25 01:44:47,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:44:47,308 INFO L93 Difference]: Finished difference Result 7277 states and 13063 transitions. [2018-10-25 01:44:47,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:44:47,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2018-10-25 01:44:47,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:44:47,351 INFO L225 Difference]: With dead ends: 7277 [2018-10-25 01:44:47,352 INFO L226 Difference]: Without dead ends: 5301 [2018-10-25 01:44:47,363 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:44:47,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5301 states. [2018-10-25 01:44:47,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5301 to 5252. [2018-10-25 01:44:47,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5252 states. [2018-10-25 01:44:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 8253 transitions. [2018-10-25 01:44:47,512 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 8253 transitions. Word has length 136 [2018-10-25 01:44:47,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:44:47,513 INFO L481 AbstractCegarLoop]: Abstraction has 5252 states and 8253 transitions. [2018-10-25 01:44:47,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:44:47,513 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 8253 transitions. [2018-10-25 01:44:47,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-25 01:44:47,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:44:47,519 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, 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] [2018-10-25 01:44:47,519 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:44:47,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:44:47,519 INFO L82 PathProgramCache]: Analyzing trace with hash -824137274, now seen corresponding path program 1 times [2018-10-25 01:44:47,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:44:47,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:47,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:44:47,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:47,521 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:44:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:44:47,767 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:44:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:44:48,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:44:48,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:44:48,169 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:44:48,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:44:48,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:44:48,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:44:48,173 INFO L87 Difference]: Start difference. First operand 5252 states and 8253 transitions. Second operand 6 states. [2018-10-25 01:45:03,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:45:03,633 INFO L93 Difference]: Finished difference Result 13917 states and 22504 transitions. [2018-10-25 01:45:03,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:45:03,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2018-10-25 01:45:03,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:45:03,676 INFO L225 Difference]: With dead ends: 13917 [2018-10-25 01:45:03,676 INFO L226 Difference]: Without dead ends: 8671 [2018-10-25 01:45:03,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:45:03,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8671 states. [2018-10-25 01:45:03,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8671 to 8605. [2018-10-25 01:45:03,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8605 states. [2018-10-25 01:45:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8605 states to 8605 states and 12805 transitions. [2018-10-25 01:45:03,892 INFO L78 Accepts]: Start accepts. Automaton has 8605 states and 12805 transitions. Word has length 139 [2018-10-25 01:45:03,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:45:03,893 INFO L481 AbstractCegarLoop]: Abstraction has 8605 states and 12805 transitions. [2018-10-25 01:45:03,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:45:03,893 INFO L276 IsEmpty]: Start isEmpty. Operand 8605 states and 12805 transitions. [2018-10-25 01:45:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-25 01:45:03,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:45:03,898 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, 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] [2018-10-25 01:45:03,898 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:45:03,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:03,899 INFO L82 PathProgramCache]: Analyzing trace with hash 2024947088, now seen corresponding path program 1 times [2018-10-25 01:45:03,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:45:03,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:03,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:45:03,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:03,900 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:45:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:45:04,152 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:45:04,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:45:04,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:45:04,152 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:45:04,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:45:04,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:45:04,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:45:04,154 INFO L87 Difference]: Start difference. First operand 8605 states and 12805 transitions. Second operand 6 states. [2018-10-25 01:45:16,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:45:16,134 INFO L93 Difference]: Finished difference Result 27252 states and 42311 transitions. [2018-10-25 01:45:16,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:45:16,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2018-10-25 01:45:16,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:45:16,211 INFO L225 Difference]: With dead ends: 27252 [2018-10-25 01:45:16,211 INFO L226 Difference]: Without dead ends: 18653 [2018-10-25 01:45:16,254 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:45:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18653 states. [2018-10-25 01:45:16,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18653 to 18564. [2018-10-25 01:45:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18564 states. [2018-10-25 01:45:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18564 states to 18564 states and 25947 transitions. [2018-10-25 01:45:16,680 INFO L78 Accepts]: Start accepts. Automaton has 18564 states and 25947 transitions. Word has length 170 [2018-10-25 01:45:16,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:45:16,681 INFO L481 AbstractCegarLoop]: Abstraction has 18564 states and 25947 transitions. [2018-10-25 01:45:16,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:45:16,681 INFO L276 IsEmpty]: Start isEmpty. Operand 18564 states and 25947 transitions. [2018-10-25 01:45:16,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-25 01:45:16,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:45:16,692 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, 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] [2018-10-25 01:45:16,693 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:45:16,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:16,693 INFO L82 PathProgramCache]: Analyzing trace with hash -658364123, now seen corresponding path program 1 times [2018-10-25 01:45:16,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:45:16,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:16,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:45:16,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:16,695 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:45:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:45:17,016 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:45:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:45:17,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:45:17,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:45:17,429 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:45:17,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:45:17,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:45:17,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:45:17,431 INFO L87 Difference]: Start difference. First operand 18564 states and 25947 transitions. Second operand 6 states. [2018-10-25 01:45:28,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:45:28,952 INFO L93 Difference]: Finished difference Result 48015 states and 74445 transitions. [2018-10-25 01:45:28,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:45:28,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 233 [2018-10-25 01:45:28,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:45:29,086 INFO L225 Difference]: With dead ends: 48015 [2018-10-25 01:45:29,086 INFO L226 Difference]: Without dead ends: 29457 [2018-10-25 01:45:29,134 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:45:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29457 states. [2018-10-25 01:45:29,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29457 to 29303. [2018-10-25 01:45:29,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29303 states. [2018-10-25 01:45:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29303 states to 29303 states and 42010 transitions. [2018-10-25 01:45:29,872 INFO L78 Accepts]: Start accepts. Automaton has 29303 states and 42010 transitions. Word has length 233 [2018-10-25 01:45:29,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:45:29,873 INFO L481 AbstractCegarLoop]: Abstraction has 29303 states and 42010 transitions. [2018-10-25 01:45:29,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:45:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 29303 states and 42010 transitions. [2018-10-25 01:45:29,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-25 01:45:29,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:45:29,892 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:29,893 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:45:29,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:29,893 INFO L82 PathProgramCache]: Analyzing trace with hash -16938847, now seen corresponding path program 1 times [2018-10-25 01:45:29,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:45:29,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:29,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:45:29,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:29,895 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:45:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:45:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 116 proven. 71 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:45:30,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:45:30,243 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:45:30,245 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-10-25 01:45:30,250 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3043], [3047], [3049], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3151], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3281], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-25 01:45:30,321 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:45:30,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:45:30,986 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:45:30,990 INFO L272 AbstractInterpreter]: Visited 110 different actions 110 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:45:31,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:31,027 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:45:31,677 INFO L232 lantSequenceWeakener]: Weakened 237 states. On average, predicates are now at 71.55% of their original sizes. [2018-10-25 01:45:31,678 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:45:31,938 INFO L413 sIntCurrentIteration]: We have 245 unified AI predicates [2018-10-25 01:45:31,939 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:45:31,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:45:31,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-10-25 01:45:31,940 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:45:31,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:45:31,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:45:31,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:45:31,941 INFO L87 Difference]: Start difference. First operand 29303 states and 42010 transitions. Second operand 6 states. [2018-10-25 01:45:37,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:45:37,360 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: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: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.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.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) 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:45:37,365 INFO L168 Benchmark]: Toolchain (without parser) took 98478.53 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 230.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:45:37,367 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:45:37,367 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2462.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:45:37,368 INFO L168 Benchmark]: Boogie Procedure Inliner took 539.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 810.0 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:45:37,369 INFO L168 Benchmark]: Boogie Preprocessor took 317.68 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: 37.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:45:37,370 INFO L168 Benchmark]: RCFGBuilder took 10835.89 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 188.2 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 2.8 MB). Peak memory consumption was 666.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:45:37,371 INFO L168 Benchmark]: TraceAbstraction took 84317.90 ms. Allocated memory was 2.5 GB in the beginning and 3.2 GB in the end (delta: 723.5 MB). Free memory was 2.2 GB in the beginning and 2.9 GB in the end (delta: -720.3 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:45:37,377 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2462.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 539.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 810.0 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 317.68 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: 37.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10835.89 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 188.2 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 2.8 MB). Peak memory consumption was 666.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 84317.90 ms. Allocated memory was 2.5 GB in the beginning and 3.2 GB in the end (delta: 723.5 MB). Free memory was 2.2 GB in the beginning and 2.9 GB in the end (delta: -720.3 MB). Peak memory consumption was 3.2 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...